skip to content
Computational complexity Preview this item
ClosePreview this item
Checking...

Computational complexity

Author: Christos H Papadimitriou
Publisher: Reading, Mass. : Addison-Wesley, ©1994.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:

Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and  Read more...

Rating:

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

Subjects
More like this

Find a copy in the library

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

Details

Genre/Form: Matériel didactique
Document Type: Book
All Authors / Contributors: Christos H Papadimitriou
ISBN: 0201530821 9780201530827
OCLC Number: 299454381
Description: xv, 523 p. : illustrations
Contents: I. ALGORITHMS. 1. Problems and Algorithms. 2. Turing Machines. 3. Undecidability. II. LOGIC. 1. Boolean Logic. 2. First Order Logic. 3. Undecidability in Logic. III. P AND NP. 1. Relations between Complexity Classes. 2. Reductions and Completeness. 3. NP-Complete Problems. 4. coNP and Function Problems. 5. Randomized Computation. 6. Cryptography. 7. Approximability. 8. On P vs. NP. IV. INSIDE P. 1. Parallel Computation. 2. Logarithmic Space. V. BEYOND NP. 1. The Polynomial Hierarchy. 2. Computation That Counts. 3. Polynomial Space. 4. A Glimpse Beyond. 0201530821T04062001
Responsibility: Christos H. Papadimitriou.
More information:

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/299454381> # Computational complexity
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "299454381" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/30840215#Place/reading_mass> ; # Reading, Mass.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/onc> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexite_algorithmique> ; # Complexité algorithmique
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/cryptographie> ; # Cryptographie
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/polynomial> ; # Polynomial
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/booleen> ; # Booleen
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/approximation> ; # Approximation
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/logique> ; # logique
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/espace> ; # Espace
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/algorithmique> ; # algorithmique
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/logique> ; # Logique
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/complexite> ; # Complexite
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexite_de_calcul_informatique> ; # complexité de calcul (informatique)
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/traitement> ; # Traitement
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexite_algorithme> ; # complexité algorithme
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/logarithmique> ; # Logarithmique
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/classe_np> ; # classe NP
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/calcul_parallele> ; # calcul parallèle
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/parallele> ; # Parallele
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/complexe> ; # Complexe
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/hasard> ; # Hasard
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/calcul> ; # Calcul
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Thing/algorithme> ; # Algorithme
    schema:about <http://dewey.info/class/004.015/e22/> ;
    schema:bookFormat bgn:PrintBook ;
    schema:copyrightYear "1994" ;
    schema:creator <http://viaf.org/viaf/37007186> ; # Christos H. Papadimitriou
    schema:datePublished "1994" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/30840215> ;
    schema:genre "Matériel didactique"@fr ;
    schema:inLanguage "en" ;
    schema:name "Computational complexity" ;
    schema:numberOfPages "523" ;
    schema:productID "299454381" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/299454381#PublicationEvent/reading_mass_addison_wesley_1994> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/30840215#Agent/addison_wesley> ; # Addison-Wesley
    schema:workExample <http://worldcat.org/isbn/9780201530827> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/299454381> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/30840215#Agent/addison_wesley> # Addison-Wesley
    a bgn:Agent ;
    schema:name "Addison-Wesley" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Place/reading_mass> # Reading, Mass.
    a schema:Place ;
    schema:name "Reading, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Thing/approximation> # Approximation
    a schema:Thing ;
    schema:name "Approximation" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Thing/cryptographie> # Cryptographie
    a schema:Thing ;
    schema:name "Cryptographie" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Thing/logarithmique> # Logarithmique
    a schema:Thing ;
    schema:name "Logarithmique" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Topic/calcul_parallele> # calcul parallèle
    a schema:Intangible ;
    schema:name "calcul parallèle" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexite_algorithme> # complexité algorithme
    a schema:Intangible ;
    schema:name "complexité algorithme" ;
    .

<http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexite_algorithmique> # Complexité algorithmique
    a schema:Intangible ;
    schema:name "Complexité algorithmique" ;
    .

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

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

<http://viaf.org/viaf/37007186> # Christos H. Papadimitriou
    a schema:Person ;
    schema:familyName "Papadimitriou" ;
    schema:givenName "Christos H." ;
    schema:name "Christos H. Papadimitriou" ;
    .

<http://worldcat.org/isbn/9780201530827>
    a schema:ProductModel ;
    schema:isbn "0201530821" ;
    schema:isbn "9780201530827" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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