skip to content
Communication complexity : a new approach to circuit depth Preview this item
ClosePreview this item
Checking...

Communication complexity : a new approach to circuit depth

Author: Mauricio Karchmer
Publisher: Cambridge, Mass. : MIT Press, ©1989.
Series: ACM doctoral dissertation award, 1988.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:

Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth.

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Mauricio Karchmer
ISBN: 0262111438 9780262111430
OCLC Number: 19810986
Description: 68 pages ; 24 cm.
Series Title: ACM doctoral dissertation award, 1988.
Responsibility: Mauricio Karchmer.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/19810986> # Communication complexity : a new approach to circuit depth
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "19810986" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/866683785#Place/cambridge_mass> ; # Cambridge, Mass.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/computabilidade_e_modelos_de_computacao> ; # Computabilidade E Modelos De Computacao
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/circuits_logiques> ; # Circuits logiques
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/theoremes_demonstration_automatique> ; # Théorèmes--Démonstration automatique
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/datenverarbeitung> ; # Datenverarbeitung
   schema:about <http://dewey.info/class/511.324/e20/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/logische_schaltung> ; # Logische Schaltung
   schema:about <http://id.worldcat.org/fast/822777> ; # Automatic theorem proving
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/boole_algebre_de> ; # Boole, Algèbre de
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Thing/logic_circuits> ; # Logic circuits
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/komplexitat> ; # Komplexität
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/boolesche_algebra> ; # Boolesche Algebra
   schema:about <http://id.worldcat.org/fast/804924> ; # Algebra, Boolean
   schema:about <http://experiment.worldcat.org/entity/work/data/866683785#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
   schema:about <http://id.worldcat.org/fast/1002031> ; # Logic circuits
   schema:bookFormat bgn:PrintBook ;
   schema:copyrightYear "1989" ;
   schema:creator <http://viaf.org/viaf/70489333> ; # Mauricio Karchmer
   schema:datePublished "1989" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/866683785> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/866683785#Series/acm_doctoral_dissertation_awards> ; # ACM doctoral dissertation awards ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/866683785#Series/acm_doctoral_dissertation_award> ; # ACM doctoral dissertation award ;
   schema:name "Communication complexity : a new approach to circuit depth"@en ;
   schema:productID "19810986" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/19810986#PublicationEvent/cambridge_mass_mit_press_1989> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/866683785#Agent/mit_press> ; # MIT Press
   schema:url <http://ieeexplore.ieee.org/servlet/opac?bknumber=6267292> ;
   schema:url <http://www.gbv.de/dms/bowker/toc/9780262111430.pdf> ;
   schema:workExample <http://worldcat.org/isbn/9780262111430> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/19810986> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/866683785#Place/cambridge_mass> # Cambridge, Mass.
    a schema:Place ;
   schema:name "Cambridge, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Series/acm_doctoral_dissertation_award> # ACM doctoral dissertation award ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/19810986> ; # Communication complexity : a new approach to circuit depth
   schema:name "ACM doctoral dissertation award ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Series/acm_doctoral_dissertation_awards> # ACM doctoral dissertation awards ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/19810986> ; # Communication complexity : a new approach to circuit depth
   schema:name "ACM doctoral dissertation awards ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Topic/boole_algebre_de> # Boole, Algèbre de
    a schema:Intangible ;
   schema:name "Boole, Algèbre de"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
   schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Topic/computabilidade_e_modelos_de_computacao> # Computabilidade E Modelos De Computacao
    a schema:Intangible ;
   schema:name "Computabilidade E Modelos De Computacao"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/866683785#Topic/theoremes_demonstration_automatique> # Théorèmes--Démonstration automatique
    a schema:Intangible ;
   schema:name "Théorèmes--Démonstration automatique"@fr ;
    .

<http://id.worldcat.org/fast/1002031> # Logic circuits
    a schema:Intangible ;
   schema:name "Logic circuits"@en ;
    .

<http://id.worldcat.org/fast/804924> # Algebra, Boolean
    a schema:Intangible ;
   schema:name "Algebra, Boolean"@en ;
    .

<http://id.worldcat.org/fast/822777> # Automatic theorem proving
    a schema:Intangible ;
   schema:name "Automatic theorem proving"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://ieeexplore.ieee.org/servlet/opac?bknumber=6267292>
   rdfs:comment "Rutgers restricted" ;
   rdfs:comment "Full text available from IEEE CISnet:" ;
    .

<http://viaf.org/viaf/70489333> # Mauricio Karchmer
    a schema:Person ;
   schema:familyName "Karchmer" ;
   schema:givenName "Mauricio" ;
   schema:name "Mauricio Karchmer" ;
    .

<http://worldcat.org/isbn/9780262111430>
    a schema:ProductModel ;
   schema:isbn "0262111438" ;
   schema:isbn "9780262111430" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.