Communication complexity:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
1997
|
Ausgabe: | 1. publ. |
Schlagworte: | |
Beschreibung: | XIII, 189 S. graph. Darst. |
ISBN: | 0521560675 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV011355679 | ||
003 | DE-604 | ||
005 | 20120104 | ||
007 | t | ||
008 | 970527s1997 d||| |||| 00||| eng d | ||
020 | |a 0521560675 |9 0-521-56067-5 | ||
035 | |a (OCoLC)889698882 | ||
035 | |a (DE-599)BVBBV011355679 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-91G |a DE-20 |a DE-188 |a DE-384 |a DE-634 | ||
084 | |a SK 950 |0 (DE-625)143273: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a DAT 517f |2 stub | ||
100 | 1 | |a Qûšileviṣ, Eyāl |e Verfasser |4 aut | |
245 | 1 | 0 | |a Communication complexity |c Eyal Kushilevitz ; Noam Nisan |
250 | |a 1. publ. | ||
264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 1997 | |
300 | |a XIII, 189 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kommunikation |0 (DE-588)4031883-7 |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 Mathematik |0 (DE-588)4037944-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |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 |
689 | 0 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |D s |
689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | 2 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
689 | 0 | 3 | |a Boolesche Algebra |0 (DE-588)4146280-4 |D s |
689 | 0 | 4 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Kommunikation |0 (DE-588)4031883-7 |D s |
689 | 1 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 1 | 2 | |a Mathematik |0 (DE-588)4037944-9 |D s |
689 | 1 | 3 | |a Logische Schaltung |0 (DE-588)4131023-8 |D s |
689 | 1 | 4 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 1 | |8 1\p |5 DE-604 | |
700 | 1 | |a Nisan, Noam |d 1961- |e Verfasser |0 (DE-588)137125372 |4 aut | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007631306 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804125866083483648 |
---|---|
any_adam_object | |
author | Qûšileviṣ, Eyāl Nisan, Noam 1961- |
author_GND | (DE-588)137125372 |
author_facet | Qûšileviṣ, Eyāl Nisan, Noam 1961- |
author_role | aut aut |
author_sort | Qûšileviṣ, Eyāl |
author_variant | e q eq n n nn |
building | Verbundindex |
bvnumber | BV011355679 |
classification_rvk | SK 950 ST 134 |
classification_tum | DAT 517f |
ctrlnum | (OCoLC)889698882 (DE-599)BVBBV011355679 |
discipline | Informatik Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02151nam a2200553 c 4500</leader><controlfield tag="001">BV011355679</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120104 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970527s1997 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521560675</subfield><subfield code="9">0-521-56067-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)889698882</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011355679</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-20</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 950</subfield><subfield code="0">(DE-625)143273:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Qûšileviṣ, Eyāl</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="c">Eyal Kushilevitz ; Noam Nisan</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 189 S.</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="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</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">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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="689" ind1="0" ind2="0"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="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="4"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kommunikation</subfield><subfield code="0">(DE-588)4031883-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="2"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Logische Schaltung</subfield><subfield code="0">(DE-588)4131023-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nisan, Noam</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137125372</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007631306</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></record></collection> |
id | DE-604.BV011355679 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:08:22Z |
institution | BVB |
isbn | 0521560675 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007631306 |
oclc_num | 889698882 |
open_access_boolean | |
owner | DE-12 DE-91G DE-BY-TUM DE-20 DE-188 DE-384 DE-634 |
owner_facet | DE-12 DE-91G DE-BY-TUM DE-20 DE-188 DE-384 DE-634 |
physical | XIII, 189 S. graph. Darst. |
publishDate | 1997 |
publishDateSearch | 1997 |
publishDateSort | 1997 |
publisher | Cambridge Univ. Press |
record_format | marc |
spelling | Qûšileviṣ, Eyāl Verfasser aut Communication complexity Eyal Kushilevitz ; Noam Nisan 1. publ. Cambridge [u.a.] Cambridge Univ. Press 1997 XIII, 189 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kommunikation (DE-588)4031883-7 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Logische Schaltung (DE-588)4131023-8 gnd rswk-swf Kommunikation (DE-588)4031883-7 s Komplexitätstheorie (DE-588)4120591-1 s Logische Schaltung (DE-588)4131023-8 s Boolesche Algebra (DE-588)4146280-4 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Komplexität (DE-588)4135369-9 s Mathematik (DE-588)4037944-9 s 1\p DE-604 Nisan, Noam 1961- Verfasser (DE-588)137125372 aut 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Qûšileviṣ, Eyāl Nisan, Noam 1961- Communication complexity Komplexitätstheorie (DE-588)4120591-1 gnd Kommunikation (DE-588)4031883-7 gnd Boolesche Algebra (DE-588)4146280-4 gnd Mathematik (DE-588)4037944-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd |
subject_GND | (DE-588)4120591-1 (DE-588)4031883-7 (DE-588)4146280-4 (DE-588)4037944-9 (DE-588)4134751-1 (DE-588)4135369-9 (DE-588)4131023-8 |
title | Communication complexity |
title_auth | Communication complexity |
title_exact_search | Communication complexity |
title_full | Communication complexity Eyal Kushilevitz ; Noam Nisan |
title_fullStr | Communication complexity Eyal Kushilevitz ; Noam Nisan |
title_full_unstemmed | Communication complexity Eyal Kushilevitz ; Noam Nisan |
title_short | Communication complexity |
title_sort | communication complexity |
topic | Komplexitätstheorie (DE-588)4120591-1 gnd Kommunikation (DE-588)4031883-7 gnd Boolesche Algebra (DE-588)4146280-4 gnd Mathematik (DE-588)4037944-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexität (DE-588)4135369-9 gnd Logische Schaltung (DE-588)4131023-8 gnd |
topic_facet | Komplexitätstheorie Kommunikation Boolesche Algebra Mathematik Berechnungskomplexität Komplexität Logische Schaltung |
work_keys_str_mv | AT qusileviseyal communicationcomplexity AT nisannoam communicationcomplexity |