zum Inhalt wechseln
Computational complexity Titelvorschau
SchließenTitelvorschau
Prüfung…

Computational complexity

Verfasser/in: Christos H Papadimitriou
Verlag: Reading, Mass. : Addison-Wesley, ©1994.
Ausgabe/Format   Print book : EnglischAlle Ausgaben und Formate anzeigen
Datenbank:WorldCat
Zusammenfassung:

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  Weiterlesen…

Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Online anzeigen

Links zu diesem Titel

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Physisches Format Online version:
Papadimitriou, Christos H.
Computational complexity.
Reading, Mass. : Addison-Wesley, ©1994
(OCoLC)654178169
Medientyp: Internetquelle
Dokumenttyp: Buch, Internet-Ressource
Alle Autoren: Christos H Papadimitriou
ISBN: 0201530821 9780201530827 0020153082 9780020153085
OCLC-Nummer: 28421912
Beschreibung: xv, 523 pages : illustrations ; 25 cm
Inhalt: pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability --
pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic --
pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP --
pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space --
pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond.
Verfasserangabe: Christos H. Papadimitriou.
Weitere Informationen:

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.

Ähnliche Titel

Verwandte Themen:(4)

Nutzerlisten mit diesen Titeln (1)

  • Keep CS(231 Titel)
    von bacnebr WorldCat-Nutzer/in; aktualisiert 2013-07-09
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


Primary Entity

<http://www.worldcat.org/oclc/28421912> # Computational complexity
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "28421912" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/30840215#Place/reading_mass> ; # Reading, Mass.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/algoritmen> ; # Algoritmen
    schema:about <http://dewey.info/class/511.3/e20/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/computational_complexity> ; # Computational complexity
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/30840215#Topic/complexiteit> ; # Complexiteit
    schema:bookFormat bgn:PrintBook ;
    schema:copyrightYear "1994" ;
    schema:creator <http://viaf.org/viaf/37007186> ; # Christos H. Papadimitriou
    schema:datePublished "1994" ;
    schema:description "pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/30840215> ;
    schema:inLanguage "en" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/654178169> ;
    schema:name "Computational complexity"@en ;
    schema:productID "28421912" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/28421912#PublicationEvent/reading_mass_addison_wesley_1994> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/30840215#Agent/addison_wesley> ; # Addison-Wesley
    schema:url <http://www.gbv.de/dms/ilmenau/toc/12708035X.PDF> ;
    schema:workExample <http://worldcat.org/isbn/9780201530827> ;
    schema:workExample <http://worldcat.org/isbn/9780020153085> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/28421912> ;
    .


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#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

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

<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/9780020153085>
    a schema:ProductModel ;
    schema:isbn "0020153082" ;
    schema:isbn "9780020153085" ;
    .

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

<http://www.worldcat.org/oclc/654178169>
    a schema:CreativeWork ;
    rdfs:label "Computational complexity." ;
    schema:description "Online version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/28421912> ; # Computational complexity
    .


Content-negotiable representations

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.