Computing Boolean functions on anonymous hypercube networks: (extended abstract)
Abstract: "We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous oriented hypercubes. We characterize the class of boolean functions computable in the anonymous oriented hypercube as exactly those boolean functions which are invariant un...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1990
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,40 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Abstract: "We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous oriented hypercubes. We characterize the class of boolean functions computable in the anonymous oriented hypercube as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercube and provide an algorithm for computing all such functions with bit complexity O(N [times] log4 N). Thus among all studied oriented networks (rings, tori, etc) the hypercube seems to achieve 'optimal' bit complexity for a given number of nodes." |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973935 | ||
| 003 | DE-604 | ||
| 005 | 20220221 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25617046 | ||
| 035 | |a (DE-599)BVBBV008973935 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Kranakis, Evangelos |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computing Boolean functions on anonymous hypercube networks |b (extended abstract) |c Evangelos Kranakis ; Danny Krizanc |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 12 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,40 | |
| 520 | 3 | |a Abstract: "We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous oriented hypercubes. We characterize the class of boolean functions computable in the anonymous oriented hypercube as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercube and provide an algorithm for computing all such functions with bit complexity O(N [times] log4 N). Thus among all studied oriented networks (rings, tori, etc) the hypercube seems to achieve 'optimal' bit complexity for a given number of nodes." | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Hypercube | |
| 700 | 1 | |a Krizanc, Danny |e Verfasser |4 aut | |
| 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,40 |w (DE-604)BV008928356 |9 90,40 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5682 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925585 | ||
Datensatz im Suchindex
| _version_ | 1804123311892856832 |
|---|---|
| any_adam_object | |
| author | Kranakis, Evangelos Krizanc, Danny |
| author_facet | Kranakis, Evangelos Krizanc, Danny |
| author_role | aut aut |
| author_sort | Kranakis, Evangelos |
| author_variant | e k ek d k dk |
| building | Verbundindex |
| bvnumber | BV008973935 |
| collection | ebook |
| ctrlnum | (OCoLC)25617046 (DE-599)BVBBV008973935 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01827nam a2200349 cb4500</leader><controlfield tag="001">BV008973935</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25617046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973935</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kranakis, Evangelos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing Boolean functions on anonymous hypercube networks</subfield><subfield code="b">(extended abstract)</subfield><subfield code="c">Evangelos Kranakis ; Danny Krizanc</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">12 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,40</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous oriented hypercubes. We characterize the class of boolean functions computable in the anonymous oriented hypercube as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercube and provide an algorithm for computing all such functions with bit complexity O(N [times] log4 N). Thus among all studied oriented networks (rings, tori, etc) the hypercube seems to achieve 'optimal' bit complexity for a given number of nodes."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypercube</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Krizanc, Danny</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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,40</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,40</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5682</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-005925585</subfield></datafield></record></collection> |
| id | DE-604.BV008973935 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925585 |
| oclc_num | 25617046 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 12 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 | Kranakis, Evangelos Verfasser aut Computing Boolean functions on anonymous hypercube networks (extended abstract) Evangelos Kranakis ; Danny Krizanc Amsterdam 1990 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,40 Abstract: "We study the bit-complexity (i.e. total number of bits transmitted) of computing boolean functions on anonymous oriented hypercubes. We characterize the class of boolean functions computable in the anonymous oriented hypercube as exactly those boolean functions which are invariant under all bit-complement automorphisms of the hypercube and provide an algorithm for computing all such functions with bit complexity O(N [times] log4 N). Thus among all studied oriented networks (rings, tori, etc) the hypercube seems to achieve 'optimal' bit complexity for a given number of nodes." Algebra, Boolean Hypercube Krizanc, Danny Verfasser aut Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,40 (DE-604)BV008928356 90,40 https://ir.cwi.nl/pub/5682 Verlag kostenfrei Volltext |
| spellingShingle | Kranakis, Evangelos Krizanc, Danny Computing Boolean functions on anonymous hypercube networks (extended abstract) Algebra, Boolean Hypercube |
| title | Computing Boolean functions on anonymous hypercube networks (extended abstract) |
| title_auth | Computing Boolean functions on anonymous hypercube networks (extended abstract) |
| title_exact_search | Computing Boolean functions on anonymous hypercube networks (extended abstract) |
| title_full | Computing Boolean functions on anonymous hypercube networks (extended abstract) Evangelos Kranakis ; Danny Krizanc |
| title_fullStr | Computing Boolean functions on anonymous hypercube networks (extended abstract) Evangelos Kranakis ; Danny Krizanc |
| title_full_unstemmed | Computing Boolean functions on anonymous hypercube networks (extended abstract) Evangelos Kranakis ; Danny Krizanc |
| title_short | Computing Boolean functions on anonymous hypercube networks |
| title_sort | computing boolean functions on anonymous hypercube networks extended abstract |
| title_sub | (extended abstract) |
| topic | Algebra, Boolean Hypercube |
| topic_facet | Algebra, Boolean Hypercube |
| url | https://ir.cwi.nl/pub/5682 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kranakisevangelos computingbooleanfunctionsonanonymoushypercubenetworksextendedabstract AT krizancdanny computingbooleanfunctionsonanonymoushypercubenetworksextendedabstract |