Some algorithms on addition chains and their Complexity:
Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use tw...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1990
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,24 |
| Schlagworte: | |
| Online-Zugang: | kostenfrei |
| Zusammenfassung: | Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use two new techniques. The first new technique involves a kind of addition chain graph, which is an important tool for studying the memory use in more detail. The second new technique concerns a way to split up the chains and sequences into subsets that can be studied independently Using number theoretical tools (especially from ergodic theory) we get some new results on upper bounds and average values for the lengths of chains and sequences. Finally we compare these algorithms using some tables. The algorithms are described in detail in this report and an example is included for most of the algorithms. |
| Beschreibung: | 69 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010156144 | ||
| 003 | DE-604 | ||
| 005 | 20220207 | ||
| 007 | t | ||
| 008 | 950427s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24021565 | ||
| 035 | |a (DE-599)BVBBV010156144 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Coster, Matthijs J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Some algorithms on addition chains and their Complexity |c M. J. Coster |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 69 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 90,24 | |
| 520 | 3 | |a Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use two new techniques. The first new technique involves a kind of addition chain graph, which is an important tool for studying the memory use in more detail. The second new technique concerns a way to split up the chains and sequences into subsets that can be studied independently | |
| 520 | 3 | |a Using number theoretical tools (especially from ergodic theory) we get some new results on upper bounds and average values for the lengths of chains and sequences. Finally we compare these algorithms using some tables. The algorithms are described in detail in this report and an example is included for most of the algorithms. | |
| 650 | 4 | |a Addition | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 90,24 |w (DE-604)BV008928356 |9 90,24 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5726 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006746307 | ||
Datensatz im Suchindex
| _version_ | 1804124552775598080 |
|---|---|
| any_adam_object | |
| author | Coster, Matthijs J. |
| author_facet | Coster, Matthijs J. |
| author_role | aut |
| author_sort | Coster, Matthijs J. |
| author_variant | m j c mj mjc |
| building | Verbundindex |
| bvnumber | BV010156144 |
| collection | ebook |
| ctrlnum | (OCoLC)24021565 (DE-599)BVBBV010156144 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02082nam a2200361 cb4500</leader><controlfield tag="001">BV010156144</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220207 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24021565</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010156144</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Coster, Matthijs J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Some algorithms on addition chains and their Complexity</subfield><subfield code="c">M. J. Coster</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">69 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">90,24</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use two new techniques. The first new technique involves a kind of addition chain graph, which is an important tool for studying the memory use in more detail. The second new technique concerns a way to split up the chains and sequences into subsets that can be studied independently</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Using number theoretical tools (especially from ergodic theory) we get some new results on upper bounds and average values for the lengths of chains and sequences. Finally we compare these algorithms using some tables. The algorithms are described in detail in this report and an example is included for most of the algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Addition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">90,24</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,24</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5726</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006746307</subfield></datafield></record></collection> |
| id | DE-604.BV010156144 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006746307 |
| oclc_num | 24021565 |
| open_access_boolean | 1 |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 69 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Coster, Matthijs J. Verfasser aut Some algorithms on addition chains and their Complexity M. J. Coster Amsterdam 1990 69 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,24 Abstract: "We consider in this report 12 algorithms, for calculating addition chains, addition sequences and vector addition chains. Some of these algorithms are new. We compare these algorithms on two criteria namely the length of the chains/sequences and the memory usage. To do this we use two new techniques. The first new technique involves a kind of addition chain graph, which is an important tool for studying the memory use in more detail. The second new technique concerns a way to split up the chains and sequences into subsets that can be studied independently Using number theoretical tools (especially from ergodic theory) we get some new results on upper bounds and average values for the lengths of chains and sequences. Finally we compare these algorithms using some tables. The algorithms are described in detail in this report and an example is included for most of the algorithms. Addition Algorithms Computational complexity Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,24 (DE-604)BV008928356 90,24 https://ir.cwi.nl/pub/5726 Verlag kostenfrei Volltext |
| spellingShingle | Coster, Matthijs J. Some algorithms on addition chains and their Complexity Addition Algorithms Computational complexity |
| title | Some algorithms on addition chains and their Complexity |
| title_auth | Some algorithms on addition chains and their Complexity |
| title_exact_search | Some algorithms on addition chains and their Complexity |
| title_full | Some algorithms on addition chains and their Complexity M. J. Coster |
| title_fullStr | Some algorithms on addition chains and their Complexity M. J. Coster |
| title_full_unstemmed | Some algorithms on addition chains and their Complexity M. J. Coster |
| title_short | Some algorithms on addition chains and their Complexity |
| title_sort | some algorithms on addition chains and their complexity |
| topic | Addition Algorithms Computational complexity |
| topic_facet | Addition Algorithms Computational complexity |
| url | https://ir.cwi.nl/pub/5726 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT costermatthijsj somealgorithmsonadditionchainsandtheircomplexity |