Partitions with restricted block sizes, Möbius functions and the k-of-each problem:
Abstract: "Given a list of n numbers in R, one wants to decide wether [sic] every number in the list occurs at least k times. I will show that (1 - [epsilon])n log₃(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lovász m...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1994
|
| Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1994,6 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Given a list of n numbers in R, one wants to decide wether [sic] every number in the list occurs at least k times. I will show that (1 - [epsilon])n log₃(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lovász method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general." |
| Beschreibung: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009930050 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941201s1994 |||| 00||| eng d | ||
| 016 | 7 | |a 941221679 |2 DE-101 | |
| 035 | |a (OCoLC)32499000 | ||
| 035 | |a (DE-599)BVBBV009930050 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 100 | 1 | |a Linusson, Svante |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Partitions with restricted block sizes, Möbius functions and the k-of-each problem |c Svante Linusson |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1994 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1994,6 | |
| 520 | 3 | |a Abstract: "Given a list of n numbers in R, one wants to decide wether [sic] every number in the list occurs at least k times. I will show that (1 - [epsilon])n log₃(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lovász method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general." | |
| 650 | 4 | |a Partitions (Mathematics) | |
| 830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1994,6 |w (DE-604)BV004801715 |9 1994,6 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006578038 | ||
Datensatz im Suchindex
| _version_ | 1804124295769620480 |
|---|---|
| any_adam_object | |
| author | Linusson, Svante |
| author_facet | Linusson, Svante |
| author_role | aut |
| author_sort | Linusson, Svante |
| author_variant | s l sl |
| building | Verbundindex |
| bvnumber | BV009930050 |
| ctrlnum | (OCoLC)32499000 (DE-599)BVBBV009930050 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01574nam a2200301 cb4500</leader><controlfield tag="001">BV009930050</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941201s1994 |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">941221679</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)32499000</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009930050</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-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Linusson, Svante</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Partitions with restricted block sizes, Möbius functions and the k-of-each problem</subfield><subfield code="c">Svante Linusson</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1994,6</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Given a list of n numbers in R, one wants to decide wether [sic] every number in the list occurs at least k times. I will show that (1 - [epsilon])n log₃(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lovász method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitions (Mathematics)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1994,6</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1994,6</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006578038</subfield></datafield></record></collection> |
| id | DE-604.BV009930050 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:43:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006578038 |
| oclc_num | 32499000 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 9 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| series2 | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| spelling | Linusson, Svante Verfasser aut Partitions with restricted block sizes, Möbius functions and the k-of-each problem Svante Linusson Berlin Konrad-Zuse-Zentrum für Informationstechnik 1994 9 S. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1994,6 Abstract: "Given a list of n numbers in R, one wants to decide wether [sic] every number in the list occurs at least k times. I will show that (1 - [epsilon])n log₃(n/k) is a lower bound for the depth of a linear decision tree determining this problem. This is done by using the Björner-Lovász method, which turns the problem into one of estimating the Möbius function for a certain partition lattice. I will also calculate the exponential generating function for the Möbius function of a partition poset with restricted block sizes in general." Partitions (Mathematics) Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1994,6 (DE-604)BV004801715 1994,6 |
| spellingShingle | Linusson, Svante Partitions with restricted block sizes, Möbius functions and the k-of-each problem Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Partitions (Mathematics) |
| title | Partitions with restricted block sizes, Möbius functions and the k-of-each problem |
| title_auth | Partitions with restricted block sizes, Möbius functions and the k-of-each problem |
| title_exact_search | Partitions with restricted block sizes, Möbius functions and the k-of-each problem |
| title_full | Partitions with restricted block sizes, Möbius functions and the k-of-each problem Svante Linusson |
| title_fullStr | Partitions with restricted block sizes, Möbius functions and the k-of-each problem Svante Linusson |
| title_full_unstemmed | Partitions with restricted block sizes, Möbius functions and the k-of-each problem Svante Linusson |
| title_short | Partitions with restricted block sizes, Möbius functions and the k-of-each problem |
| title_sort | partitions with restricted block sizes mobius functions and the k of each problem |
| topic | Partitions (Mathematics) |
| topic_facet | Partitions (Mathematics) |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT linussonsvante partitionswithrestrictedblocksizesmobiusfunctionsandthekofeachproblem |