The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Trier
Univ. Trier, Mathematik, Informatik
|
| Schriftenreihe: | Mathematik, Informatik: Forschungsbericht Universität <Trier>
1994,4 |
| Beschreibung: | 14, III Bl. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009872199 | ||
| 003 | DE-604 | ||
| 005 | 19970416 | ||
| 007 | t| | ||
| 008 | 941102nuuuuuuuuxx d||| |||| 00||| undod | ||
| 035 | |a (OCoLC)165124720 | ||
| 035 | |a (DE-599)BVBBV009872199 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 |a DE-29T |a DE-91G |a DE-473 |a DE-824 | ||
| 084 | |a SI 990 |0 (DE-625)143213: |2 rvk | ||
| 100 | 1 | |a Meinel, Christoph |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem |c Ch. Meinel ; St. Waack |
| 264 | 1 | |a Trier |b Univ. Trier, Mathematik, Informatik | |
| 300 | |a 14, III Bl. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Trier> / Mathematik, Informatik: Forschungsbericht |v 1994,4 | |
| 700 | 1 | |a Waack, Stephan |d 1954- |e Verfasser |0 (DE-588)110649303 |4 aut | |
| 800 | 1 | |a Mathematik, Informatik: Forschungsbericht |t Universität <Trier> |v 1994,4 |w (DE-604)BV006128208 |9 1994,4 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006538406 | |
Datensatz im Suchindex
| _version_ | 1820882542131150848 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Meinel, Christoph Waack, Stephan 1954- |
| author_GND | (DE-588)110649303 |
| author_facet | Meinel, Christoph Waack, Stephan 1954- |
| author_role | aut aut |
| author_sort | Meinel, Christoph |
| author_variant | c m cm s w sw |
| building | Verbundindex |
| bvnumber | BV009872199 |
| classification_rvk | SI 990 |
| ctrlnum | (OCoLC)165124720 (DE-599)BVBBV009872199 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV009872199</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970416</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">941102nuuuuuuuuxx d||| |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165124720</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009872199</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-824</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 990</subfield><subfield code="0">(DE-625)143213:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meinel, Christoph</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem</subfield><subfield code="c">Ch. Meinel ; St. Waack</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Trier</subfield><subfield code="b">Univ. Trier, Mathematik, Informatik</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14, III 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="490" ind1="1" ind2=" "><subfield code="a">Universität <Trier> / Mathematik, Informatik: Forschungsbericht</subfield><subfield code="v">1994,4</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Waack, Stephan</subfield><subfield code="d">1954-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110649303</subfield><subfield code="4">aut</subfield></datafield><datafield tag="800" ind1="1" ind2=" "><subfield code="a">Mathematik, Informatik: Forschungsbericht</subfield><subfield code="t">Universität <Trier></subfield><subfield code="v">1994,4</subfield><subfield code="w">(DE-604)BV006128208</subfield><subfield code="9">1994,4</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006538406</subfield></datafield></record></collection> |
| id | DE-604.BV009872199 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:08:33Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006538406 |
| oclc_num | 165124720 |
| open_access_boolean | |
| owner | DE-12 DE-29T DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-824 |
| owner_facet | DE-12 DE-29T DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-824 |
| physical | 14, III Bl. graph. Darst. |
| publishDateSort | 0000 |
| publisher | Univ. Trier, Mathematik, Informatik |
| record_format | marc |
| series | Mathematik, Informatik: Forschungsbericht Universität <Trier> |
| series2 | Universität <Trier> / Mathematik, Informatik: Forschungsbericht |
| spelling | Meinel, Christoph Verfasser aut The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem Ch. Meinel ; St. Waack Trier Univ. Trier, Mathematik, Informatik 14, III Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universität <Trier> / Mathematik, Informatik: Forschungsbericht 1994,4 Waack, Stephan 1954- Verfasser (DE-588)110649303 aut Mathematik, Informatik: Forschungsbericht Universität <Trier> 1994,4 (DE-604)BV006128208 1994,4 |
| spellingShingle | Meinel, Christoph Waack, Stephan 1954- The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem Mathematik, Informatik: Forschungsbericht Universität <Trier> |
| title | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem |
| title_auth | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem |
| title_exact_search | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem |
| title_full | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem Ch. Meinel ; St. Waack |
| title_fullStr | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem Ch. Meinel ; St. Waack |
| title_full_unstemmed | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem Ch. Meinel ; St. Waack |
| title_short | The Möbius function, variations ranks and Theta(n)-bounds on the modular communication complexity of the undirected graph connectivity problem |
| title_sort | the mobius function variations ranks and theta n bounds on the modular communication complexity of the undirected graph connectivity problem |
| volume_link | (DE-604)BV006128208 |
| work_keys_str_mv | AT meinelchristoph themobiusfunctionvariationsranksandthetanboundsonthemodularcommunicationcomplexityoftheundirectedgraphconnectivityproblem AT waackstephan themobiusfunctionvariationsranksandthetanboundsonthemodularcommunicationcomplexityoftheundirectedgraphconnectivityproblem |