Communication complexity: a new approach to circuit depth
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge, Mass.
MIT Press
c1989
|
| Series: | ACM doctoral dissertation awards
1988 |
| Subjects: | |
| Online Access: | FHA01 FHI01 Volltext |
| Item Description: | Includes index Bibliography: p. [65]-66 |
| Physical Description: | 1 Online-Ressource (68 p.) |
| ISBN: | 0262111438 0262256495 9780262111430 9780262256490 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042509060 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150417s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 0262111438 |9 0-262-11143-8 | ||
| 020 | |a 0262256495 |c electronic bk. |9 0-262-25649-5 | ||
| 020 | |a 9780262111430 |9 978-0-262-11143-0 | ||
| 020 | |a 9780262256490 |c electronic bk. |9 978-0-262-25649-0 | ||
| 035 | |a (OCoLC)827009311 | ||
| 035 | |a (DE-599)BVBBV042509060 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-Aug4 |a DE-573 | ||
| 082 | 0 | |a 511.3/24 |2 22 | |
| 100 | 1 | |a Karchmer, Mauricio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Communication complexity |b a new approach to circuit depth |c Mauricio Karchmer |
| 264 | 1 | |a Cambridge, Mass. |b MIT Press |c c1989 | |
| 300 | |a 1 Online-Ressource (68 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a ACM doctoral dissertation awards |v 1988 | |
| 500 | |a Includes index | ||
| 500 | |a Bibliography: p. [65]-66 | ||
| 650 | 4 | |a Boole, Algèbre de | |
| 650 | 4 | |a Circuits logiques | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 4 | |a Théorèmes / Démonstration automatique | |
| 650 | 7 | |a Computabilidade E Modelos De Computacao |2 larpcal | |
| 650 | 7 | |a Logische Schaltung |2 swd | |
| 650 | 7 | |a Komplexität |2 swd | |
| 650 | 7 | |a Datenverarbeitung |2 swd | |
| 650 | 7 | |a Boolesche Algebra |2 swd | |
| 650 | 7 | |a Algebra, Boolean |2 fast | |
| 650 | 7 | |a Automatic theorem proving |2 fast | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Logic circuits |2 fast | |
| 650 | 4 | |a Algebra, Boolean | |
| 650 | 4 | |a Logic circuits | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Boolesche Algebra |0 (DE-588)4146280-4 |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 Logische Schaltung |0 (DE-588)4131023-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |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 | |8 2\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292 |x Verlag |3 Volltext |
| 912 | |a ZDB-37-IEM | ||
| 940 | 1 | |q ZDB-37-IEM_GB/15 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027943624 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292 |l FHA01 |p ZDB-37-IEM |x Verlag |3 Volltext | |
| 966 | e | |u http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292 |l FHI01 |p ZDB-37-IEM |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804153253193056256 |
|---|---|
| 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 | BV042509060 |
| collection | ZDB-37-IEM |
| ctrlnum | (OCoLC)827009311 (DE-599)BVBBV042509060 |
| 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 | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02946nmm a2200745zcb4500</leader><controlfield tag="001">BV042509060</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150417s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262111438</subfield><subfield code="9">0-262-11143-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262256495</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-262-25649-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262111430</subfield><subfield code="9">978-0-262-11143-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262256490</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-262-25649-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)827009311</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042509060</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/24</subfield><subfield code="2">22</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><subfield code="c">Mauricio Karchmer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">MIT Press</subfield><subfield code="c">c1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (68 p.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">ACM doctoral dissertation awards</subfield><subfield code="v">1988</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Bibliography: p. [65]-66</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="4"><subfield code="a">Théorèmes / Démonstration automatique</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="7"><subfield code="a">Logische Schaltung</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Komplexität</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Boolesche Algebra</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebra, Boolean</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatic theorem proving</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logic circuits</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Boolean</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic circuits</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</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">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="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">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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-37-IEM</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-37-IEM_GB/15</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027943624</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-37-IEM</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-37-IEM</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042509060 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:23:40Z |
| institution | BVB |
| isbn | 0262111438 0262256495 9780262111430 9780262256490 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027943624 |
| oclc_num | 827009311 |
| open_access_boolean | |
| owner | DE-Aug4 DE-573 |
| owner_facet | DE-Aug4 DE-573 |
| physical | 1 Online-Ressource (68 p.) |
| psigel | ZDB-37-IEM ZDB-37-IEM_GB/15 |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | MIT Press |
| record_format | marc |
| series2 | ACM doctoral dissertation awards |
| spelling | Karchmer, Mauricio Verfasser aut Communication complexity a new approach to circuit depth Mauricio Karchmer Cambridge, Mass. MIT Press c1989 1 Online-Ressource (68 p.) txt rdacontent c rdamedia cr rdacarrier ACM doctoral dissertation awards 1988 Includes index Bibliography: p. [65]-66 Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Théorèmes / Démonstration automatique Computabilidade E Modelos De Computacao larpcal Logische Schaltung swd Komplexität swd Datenverarbeitung swd Boolesche Algebra swd Algebra, Boolean fast Automatic theorem proving fast Computational complexity fast Logic circuits fast Algebra, Boolean Logic circuits Computational complexity Automatic theorem proving Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Logische Schaltung (DE-588)4131023-8 gnd rswk-swf 1\p (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 2\p DE-604 http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Karchmer, Mauricio Communication complexity a new approach to circuit depth Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Théorèmes / Démonstration automatique Computabilidade E Modelos De Computacao larpcal Logische Schaltung swd Komplexität swd Datenverarbeitung swd Boolesche Algebra swd Algebra, Boolean fast Automatic theorem proving fast Computational complexity fast Logic circuits fast Algebra, Boolean Logic circuits Computational complexity Automatic theorem proving Datenverarbeitung (DE-588)4011152-0 gnd Boolesche Algebra (DE-588)4146280-4 gnd Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd |
| subject_GND | (DE-588)4011152-0 (DE-588)4146280-4 (DE-588)4135369-9 (DE-588)4131023-8 (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 Mauricio Karchmer |
| title_fullStr | Communication complexity a new approach to circuit depth Mauricio Karchmer |
| title_full_unstemmed | Communication complexity a new approach to circuit depth Mauricio Karchmer |
| 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) Théorèmes / Démonstration automatique Computabilidade E Modelos De Computacao larpcal Logische Schaltung swd Komplexität swd Datenverarbeitung swd Boolesche Algebra swd Algebra, Boolean fast Automatic theorem proving fast Computational complexity fast Logic circuits fast Algebra, Boolean Logic circuits Computational complexity Automatic theorem proving Datenverarbeitung (DE-588)4011152-0 gnd Boolesche Algebra (DE-588)4146280-4 gnd Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd |
| topic_facet | Boole, Algèbre de Circuits logiques Complexité de calcul (Informatique) Théorèmes / Démonstration automatique Computabilidade E Modelos De Computacao Logische Schaltung Komplexität Datenverarbeitung Boolesche Algebra Algebra, Boolean Automatic theorem proving Computational complexity Logic circuits Hochschulschrift |
| url | http://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267292 |
| work_keys_str_mv | AT karchmermauricio communicationcomplexityanewapproachtocircuitdepth |