skip to content
Efficient checking of polynomials and proofs and the hardness of approximation problems Preview this item
ClosePreview this item
Checking...

Efficient checking of polynomials and proofs and the hardness of approximation problems

Author: Madhu Sudan
Publisher: Berlin [u.a.] Springer 1995
Series: Lecture notes in computer science, 1001
Edition/Format:   Computer file : EnglishView all editions and formats
Summary:

This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition.

Rating:

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

Subjects
More like this

 

Find a copy online

Find a copy in the library

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

Details

Material Type: Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Madhu Sudan
ISBN: 3540606157 9783540606154
OCLC Number: 845513293
Notes: Literaturverz. S. [73] - 78
Description: Online-Ressource (XIV, 87 S.)
Contents: On the resilience of polynomials.- Low-degree tests.- Transparent proofs and the class PCP.- Hardness of approximations.- Conclusions.
Series Title: Lecture notes in computer science, 1001
Responsibility: Madhu Sudan
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/845513293> # Efficient checking of polynomials and proofs and the hardness of approximation problems
    a bgn:ComputerFile, schema:CreativeWork ;
   library:oclcnum "845513293" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/30774504#Place/berlin_u_a> ; # Berlin u.a.
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/polynomapproximation> ; # Polynomapproximation
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/np_vollstandiges_problem> ; # NP-vollständiges Problem
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/komplexitatsklasse> ; # Komplexitätsklasse
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/approximation> ; # Approximation
   schema:about <http://dewey.info/class/005.14015113/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/beweis> ; # Beweis
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/komplexitat> ; # Komplexität
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/optimierungsproblem> ; # Optimierungsproblem
   schema:about <http://experiment.worldcat.org/entity/work/data/30774504#Topic/polynomialzeitalgorithmus> ; # Polynomialzeitalgorithmus
   schema:creator <http://viaf.org/viaf/32154680> ; # Madhu Sudan
   schema:datePublished "1995" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/30774504> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/30774504#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/30774504#Series/> ; #
   schema:name "Efficient checking of polynomials and proofs and the hardness of approximation problems" ;
   schema:productID "845513293" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/845513293#PublicationEvent/berlin_u_a_springer1995> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/30774504#Agent/springer> ; # Springer
   schema:url <http://www.springerlink.com/content/u3x3g7368k85> ;
   schema:url <http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-60615-4> ;
   schema:url <http://dx.doi.org/10.1007/3-540-60615-7> ;
   schema:workExample <http://worldcat.org/isbn/9783540606154> ;
   schema:workExample <http://dx.doi.org/10.1007/3-540-60615-7> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/845513293> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/30774504#Series/> #
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/845513293> ; # Efficient checking of polynomials and proofs and the hardness of approximation problems
   schema:name "" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Series/lecture_notes_in_computer_science> # Lecture notes in computer science
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/845513293> ; # Efficient checking of polynomials and proofs and the hardness of approximation problems
   schema:name "Lecture notes in computer science" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Topic/komplexitatsklasse> # Komplexitätsklasse
    a schema:Intangible ;
   schema:name "Komplexitätsklasse" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Topic/np_vollstandiges_problem> # NP-vollständiges Problem
    a schema:Intangible ;
   schema:name "NP-vollständiges Problem" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Topic/optimierungsproblem> # Optimierungsproblem
    a schema:Intangible ;
   schema:name "Optimierungsproblem" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Topic/polynomapproximation> # Polynomapproximation
    a schema:Intangible ;
   schema:name "Polynomapproximation" ;
    .

<http://experiment.worldcat.org/entity/work/data/30774504#Topic/polynomialzeitalgorithmus> # Polynomialzeitalgorithmus
    a schema:Intangible ;
   schema:name "Polynomialzeitalgorithmus" ;
    .

<http://viaf.org/viaf/32154680> # Madhu Sudan
    a schema:Person ;
   schema:familyName "Sudan" ;
   schema:givenName "Madhu" ;
   schema:name "Madhu Sudan" ;
    .

<http://worldcat.org/isbn/9783540606154>
    a schema:ProductModel ;
   schema:isbn "3540606157" ;
   schema:isbn "9783540606154" ;
    .

<http://www.worldcat.org/title/-/oclc/845513293>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/845513293> ; # Efficient checking of polynomials and proofs and the hardness of approximation problems
   schema:dateModified "2017-09-03" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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