The Average-case complexity of determining the majority:
Abstract: "Given a set of n elements each of which is either red or blue, it is known that in the worst case n - v(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where v(n) is the number of 1-bits in the binary representation of n. We...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science
1994
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Given a set of n elements each of which is either red or blue, it is known that in the worst case n - v(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where v(n) is the number of 1-bits in the binary representation of n. We prove that 2n/3 - [square root] 8n/9[pi]+O(log n) such comparisons are necessary and sufficient in the average case." |
| Beschreibung: | 16 Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035644031 | ||
| 003 | DE-604 | ||
| 005 | 20090728 | ||
| 007 | t | ||
| 008 | 090723s1994 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)31750042 | ||
| 035 | |a (DE-599)GBV181601885 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UIUCDCS-R-94-1865 | ||
| 088 | |a UILU-ENG-94-1723 | ||
| 100 | 1 | |a Alonso, Laurent |d 195X- |e Verfasser |0 (DE-588)134235347 |4 aut | |
| 245 | 1 | 0 | |a The Average-case complexity of determining the majority |c Laurent Alonso ; Edward M. Reingold ; René Schott |
| 246 | 1 | 3 | |a UIUCDCS R 94-1865 |
| 264 | 1 | |a Urbana, Ill. |b Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1994 | |
| 300 | |a 16 Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "Given a set of n elements each of which is either red or blue, it is known that in the worst case n - v(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where v(n) is the number of 1-bits in the binary representation of n. We prove that 2n/3 - [square root] 8n/9[pi]+O(log n) such comparisons are necessary and sufficient in the average case." | |
| 650 | 4 | |a Algorithms | |
| 700 | 1 | |a Reingold, Edward M. |e Verfasser |4 aut | |
| 700 | 1 | |a Schott, René |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017698767 | ||
Datensatz im Suchindex
| _version_ | 1804139326548738048 |
|---|---|
| any_adam_object | |
| author | Alonso, Laurent 195X- Reingold, Edward M. Schott, René |
| author_GND | (DE-588)134235347 |
| author_facet | Alonso, Laurent 195X- Reingold, Edward M. Schott, René |
| author_role | aut aut aut |
| author_sort | Alonso, Laurent 195X- |
| author_variant | l a la e m r em emr r s rs |
| building | Verbundindex |
| bvnumber | BV035644031 |
| ctrlnum | (OCoLC)31750042 (DE-599)GBV181601885 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01469nam a2200337 c 4500</leader><controlfield tag="001">BV035644031</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090728 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090723s1994 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31750042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV181601885</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</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="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-94-1865</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-94-1723</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alonso, Laurent</subfield><subfield code="d">195X-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134235347</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Average-case complexity of determining the majority</subfield><subfield code="c">Laurent Alonso ; Edward M. Reingold ; René Schott</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 94-1865</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 Bl.</subfield><subfield code="b">graph. Darst.</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="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Given a set of n elements each of which is either red or blue, it is known that in the worst case n - v(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where v(n) is the number of 1-bits in the binary representation of n. We prove that 2n/3 - [square root] 8n/9[pi]+O(log n) such comparisons are necessary and sufficient in the average case."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reingold, Edward M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schott, René</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017698767</subfield></datafield></record></collection> |
| id | DE-604.BV035644031 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:42:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017698767 |
| oclc_num | 31750042 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 Bl. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spelling | Alonso, Laurent 195X- Verfasser (DE-588)134235347 aut The Average-case complexity of determining the majority Laurent Alonso ; Edward M. Reingold ; René Schott UIUCDCS R 94-1865 Urbana, Ill. Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science 1994 16 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Abstract: "Given a set of n elements each of which is either red or blue, it is known that in the worst case n - v(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the majority color, where v(n) is the number of 1-bits in the binary representation of n. We prove that 2n/3 - [square root] 8n/9[pi]+O(log n) such comparisons are necessary and sufficient in the average case." Algorithms Reingold, Edward M. Verfasser aut Schott, René Verfasser aut |
| spellingShingle | Alonso, Laurent 195X- Reingold, Edward M. Schott, René The Average-case complexity of determining the majority Algorithms |
| title | The Average-case complexity of determining the majority |
| title_alt | UIUCDCS R 94-1865 |
| title_auth | The Average-case complexity of determining the majority |
| title_exact_search | The Average-case complexity of determining the majority |
| title_full | The Average-case complexity of determining the majority Laurent Alonso ; Edward M. Reingold ; René Schott |
| title_fullStr | The Average-case complexity of determining the majority Laurent Alonso ; Edward M. Reingold ; René Schott |
| title_full_unstemmed | The Average-case complexity of determining the majority Laurent Alonso ; Edward M. Reingold ; René Schott |
| title_short | The Average-case complexity of determining the majority |
| title_sort | the average case complexity of determining the majority |
| topic | Algorithms |
| topic_facet | Algorithms |
| work_keys_str_mv | AT alonsolaurent theaveragecasecomplexityofdeterminingthemajority AT reingoldedwardm theaveragecasecomplexityofdeterminingthemajority AT schottrene theaveragecasecomplexityofdeterminingthemajority AT alonsolaurent uiucdcsr941865 AT reingoldedwardm uiucdcsr941865 AT schottrene uiucdcsr941865 |