Communication complexity: a new approach to circuit depth
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass. u.a.
MIT Press
1989
|
| Schriftenreihe: | Association for Computing Machinery: ACM doctoral dissertation awards
1988 |
| Schlagworte: | |
| Beschreibung: | Zugl.: Jerusalem, Hebrew Univ., Diss., 1988 |
| Beschreibung: | 68 S. |
| ISBN: | 0262111438 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV004136414 | ||
| 003 | DE-604 | ||
| 005 | 20140821 | ||
| 007 | t | ||
| 008 | 901106s1989 m||| 00||| engod | ||
| 020 | |a 0262111438 |9 0-262-11143-8 | ||
| 035 | |a (OCoLC)19810986 | ||
| 035 | |a (DE-599)BVBBV004136414 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-739 | ||
| 050 | 0 | |a QA10.3 | |
| 082 | 0 | |a 511.3/24 |2 20 | |
| 084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
| 084 | |a DAT 195d |2 stub | ||
| 100 | 1 | |a Karchmer, Mauricio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Communication complexity |b a new approach to circuit depth |
| 264 | 1 | |a Cambridge, Mass. u.a. |b MIT Press |c 1989 | |
| 300 | |a 68 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Association for Computing Machinery: ACM doctoral dissertation awards |v 1988 | |
| 500 | |a Zugl.: Jerusalem, Hebrew Univ., Diss., 1988 | ||
| 650 | 4 | |a Boole, Algèbre de | |
| 650 | 4 | |a Circuits logiques | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Computabilidade E Modelos De Computacao |2 larpcal | |
| 650 | 4 | |a Théorèmes - Démonstration automatique | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Logic circuits | |
| 650 | 0 | 7 | |a Logische Schaltung |0 (DE-588)4131023-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Boolesche Algebra |0 (DE-588)4146280-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
| 689 | 0 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 0 | 2 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | 3 | |a Boolesche Algebra |0 (DE-588)4146280-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Association for Computing Machinery: ACM doctoral dissertation awards |v 1988 |w (DE-604)BV000012532 |9 1988 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002580647 | ||
Datensatz im Suchindex
| _version_ | 1804118351070363648 |
|---|---|
| any_adam_object | |
| author | Karchmer, Mauricio |
| author_facet | Karchmer, Mauricio |
| author_role | aut |
| author_sort | Karchmer, Mauricio |
| author_variant | m k mk |
| building | Verbundindex |
| bvnumber | BV004136414 |
| callnumber-first | Q - Science |
| callnumber-label | QA10 |
| callnumber-raw | QA10.3 |
| callnumber-search | QA10.3 |
| callnumber-sort | QA 210.3 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 125 |
| classification_tum | DAT 195d |
| ctrlnum | (OCoLC)19810986 (DE-599)BVBBV004136414 |
| dewey-full | 511.3/24 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/24 |
| dewey-search | 511.3/24 |
| dewey-sort | 3511.3 224 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02084nam a2200565 cb4500</leader><controlfield tag="001">BV004136414</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140821 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901106s1989 m||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262111438</subfield><subfield code="9">0-262-11143-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)19810986</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004136414</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><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA10.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/24</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 195d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Karchmer, Mauricio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Communication complexity</subfield><subfield code="b">a new approach to circuit depth</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. u.a.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">68 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">Association for Computing Machinery: ACM doctoral dissertation awards</subfield><subfield code="v">1988</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Jerusalem, Hebrew Univ., Diss., 1988</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Boole, Algèbre de</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Circuits logiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computabilidade E Modelos De Computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorèmes - Démonstration automatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic circuits</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Association for Computing Machinery: ACM doctoral dissertation awards</subfield><subfield code="v">1988</subfield><subfield code="w">(DE-604)BV000012532</subfield><subfield code="9">1988</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002580647</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV004136414 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:08:55Z |
| institution | BVB |
| isbn | 0262111438 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002580647 |
| oclc_num | 19810986 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-739 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-739 |
| physical | 68 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | MIT Press |
| record_format | marc |
| series | Association for Computing Machinery: ACM doctoral dissertation awards |
| series2 | Association for Computing Machinery: ACM doctoral dissertation awards |
| spelling | Karchmer, Mauricio Verfasser aut Communication complexity a new approach to circuit depth Cambridge, Mass. u.a. MIT Press 1989 68 S. txt rdacontent n rdamedia nc rdacarrier Association for Computing Machinery: ACM doctoral dissertation awards 1988 Zugl.: Jerusalem, Hebrew Univ., Diss., 1988 Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Théorèmes - Démonstration automatique Algebra, Boolean Automatic theorem proving Computational complexity Logic circuits Logische Schaltung (DE-588)4131023-8 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Logische Schaltung (DE-588)4131023-8 s Komplexität (DE-588)4135369-9 s Datenverarbeitung (DE-588)4011152-0 s Boolesche Algebra (DE-588)4146280-4 s DE-604 Association for Computing Machinery: ACM doctoral dissertation awards 1988 (DE-604)BV000012532 1988 |
| spellingShingle | Karchmer, Mauricio Communication complexity a new approach to circuit depth Association for Computing Machinery: ACM doctoral dissertation awards Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Théorèmes - Démonstration automatique Algebra, Boolean Automatic theorem proving Computational complexity Logic circuits Logische Schaltung (DE-588)4131023-8 gnd Datenverarbeitung (DE-588)4011152-0 gnd Komplexität (DE-588)4135369-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd |
| subject_GND | (DE-588)4131023-8 (DE-588)4011152-0 (DE-588)4135369-9 (DE-588)4146280-4 (DE-588)4113937-9 |
| title | Communication complexity a new approach to circuit depth |
| title_auth | Communication complexity a new approach to circuit depth |
| title_exact_search | Communication complexity a new approach to circuit depth |
| title_full | Communication complexity a new approach to circuit depth |
| title_fullStr | Communication complexity a new approach to circuit depth |
| title_full_unstemmed | Communication complexity a new approach to circuit depth |
| title_short | Communication complexity |
| title_sort | communication complexity a new approach to circuit depth |
| title_sub | a new approach to circuit depth |
| topic | Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao larpcal Théorèmes - Démonstration automatique Algebra, Boolean Automatic theorem proving Computational complexity Logic circuits Logische Schaltung (DE-588)4131023-8 gnd Datenverarbeitung (DE-588)4011152-0 gnd Komplexität (DE-588)4135369-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd |
| topic_facet | Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Computabilidade E Modelos De Computacao Théorèmes - Démonstration automatique Algebra, Boolean Automatic theorem proving Computational complexity Logic circuits Logische Schaltung Datenverarbeitung Komplexität Boolesche Algebra Hochschulschrift |
| volume_link | (DE-604)BV000012532 |
| work_keys_str_mv | AT karchmermauricio communicationcomplexityanewapproachtocircuitdepth |