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

Computational complexity theory

Author: Steven Rudich; Avi Wigderson
Publisher: Providence, R.I. : American Mathematical Society ; [Princeton, N.J.] : Institute for Advanced Study, ©2004.
Series: IAS/Park City mathematics series.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures  Read more...
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

Genre/Form: Electronic books
Additional Physical Format: Print version:
Computational complexity theory /
(DLC) 2004049026
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Steven Rudich; Avi Wigderson
ISBN: 9781470439095 1470439093 082182872X 9780821828724
OCLC Number: 989866188
Notes: "Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--Title page verso.
Description: 1 online resource (xiv, 389 pages : illustrations).
Contents: Introduction Complexity theory: From Gödel to Feynman Average case complexity Exploring complexity through reductions Quantum computation Circuit and Communication Complexity Proof complexity Preface to "Week Three: Randomness in Computation" Pseudorandomness --
Part I Pseudorandomness --
Part II Probabilistic proof systems --
Part I Probabilistically checkable proofs.
Series Title: IAS/Park City mathematics series.
Responsibility: Steven Rudich, Avi Wigderson, editors.

Abstract:

Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic mo.

Reviews

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

Tags

Be the first.

Similar Items

Related Subjects:(1)

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/989866188> # Computational complexity theory
    a schema:Book, schema:CreativeWork, schema:MediaObject ;
   library:oclcnum "989866188" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/354399021#Place/providence_r_i> ; # Providence, R.I.
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/354399021#Place/princeton_n_j> ; # Princeton, N.J.
   schema:about <http://experiment.worldcat.org/entity/work/data/354399021#Topic/computational_complexity> ; # Computational complexity
   schema:about <http://dewey.info/class/511.352/e22/> ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/354399021#Person/rudich_steven> ; # Steven Rudich
   schema:contributor <http://experiment.worldcat.org/entity/work/data/354399021#Person/wigderson_avi> ; # Avi Wigderson
   schema:copyrightYear "2004" ;
   schema:datePublished "2004" ;
   schema:description "Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic mo."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/354399021> ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/354399021#Series/ias_park_city_mathematics_series> ; # IAS/Park City mathematics series.
   schema:isSimilarTo <http://worldcat.org/entity/work/data/354399021#CreativeWork/computational_complexity_theory> ;
   schema:name "Computational complexity theory"@en ;
   schema:productID "989866188" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/989866188#PublicationEvent/providence_r_i_american_mathematical_society_princeton_n_j_institute_for_advanced_study_2004> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/354399021#Agent/institute_for_advanced_study> ; # Institute for Advanced Study
   schema:publisher <http://experiment.worldcat.org/entity/work/data/354399021#Agent/american_mathematical_society> ; # American Mathematical Society
   schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=4908593> ;
   schema:url <http://www.ams.org/pcms/010> ;
   schema:url <https://doi.org/10.1090/pcms/010> ;
   schema:workExample <http://worldcat.org/isbn/9781470439095> ;
   schema:workExample <http://worldcat.org/isbn/9780821828724> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/989866188> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/354399021#Agent/american_mathematical_society> # American Mathematical Society
    a bgn:Agent ;
   schema:name "American Mathematical Society" ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Agent/institute_for_advanced_study> # Institute for Advanced Study
    a bgn:Agent ;
   schema:name "Institute for Advanced Study" ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Person/rudich_steven> # Steven Rudich
    a schema:Person ;
   schema:familyName "Rudich" ;
   schema:givenName "Steven" ;
   schema:name "Steven Rudich" ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Person/wigderson_avi> # Avi Wigderson
    a schema:Person ;
   schema:familyName "Wigderson" ;
   schema:givenName "Avi" ;
   schema:name "Avi Wigderson" ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Place/princeton_n_j> # Princeton, N.J.
    a schema:Place ;
   schema:name "Princeton, N.J." ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Place/providence_r_i> # Providence, R.I.
    a schema:Place ;
   schema:name "Providence, R.I." ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Series/ias_park_city_mathematics_series> # IAS/Park City mathematics series.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/989866188> ; # Computational complexity theory
   schema:name "IAS/Park City mathematics series." ;
   schema:name "IAS/Park City Mathematics Series ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/354399021#Topic/computational_complexity> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://worldcat.org/entity/work/data/354399021#CreativeWork/computational_complexity_theory>
    a schema:CreativeWork ;
   rdfs:label "Computational complexity theory /" ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/989866188> ; # Computational complexity theory
    .

<http://worldcat.org/isbn/9780821828724>
    a schema:ProductModel ;
   schema:isbn "082182872X" ;
   schema:isbn "9780821828724" ;
    .

<http://worldcat.org/isbn/9781470439095>
    a schema:ProductModel ;
   schema:isbn "1470439093" ;
   schema:isbn "9781470439095" ;
    .

<https://doi.org/10.1090/pcms/010>
   rdfs:comment "AMS IAS/Park City Mathematics Series. UCB Access" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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