1 Ocak 2012 Dergi makalesi Açık Erişim

Akleylek, Sedat; Cenk, Murat; Ozbudak, Ferruh

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:86505</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">We give an efficient multiplication method for polynomials in Chebyshev form. This multiplication method is different from the previous ones. Theoretically, we show that the number of multiplications is at least as good as Karatsuba-based algorithm. Moreover, using the proposed method, we improve the number of additions slightly. We remark that our method works efficiently for any N and it is easy to implement. To the best of our knowledge, the proposed method has the best multiplication and addition complexity for the N-term polynomial multiplication in Chebyshev form with 3 &amp;lt;= N &amp;lt;= 13.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Akleylek, Sedat</subfield>
    <subfield code="u">Ondokuz Mayis Univ, Dept Comp Engn, Samsun, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:36c6c5012ef6b082c7779adf10c2f0b7</subfield>
    <subfield code="s">144</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/86505/files/bib-9eb19bd9-516f-41df-89f7-fa7b77bae2e1.txt</subfield>
  </datafield>
  <controlfield tag="005">20210316065625.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2012-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1109/TC.2011.38</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">On the Polynomial Multiplication in Chebyshev Form</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">61</subfield>
    <subfield code="p">IEEE TRANSACTIONS ON COMPUTERS</subfield>
    <subfield code="c">584-587</subfield>
    <subfield code="n">4</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Cenk, Murat</subfield>
    <subfield code="u">Univ Waterloo, Dept Elect &amp; Comp Engn, Waterloo, ON N2L 3G1, Canada</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Ozbudak, Ferruh</subfield>
    <subfield code="u">Middle E Tech Univ, Dept Math, Inst Appl Math, TR-06531 Ankara, Turkey</subfield>
  </datafield>
  <controlfield tag="001">86505</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>