[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jacm/AroraS98>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Shmuel_Safra>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F273865.273901>
foaf:homepage <https://doi.org/10.1145/273865.273901>
dc:identifier DBLP journals/jacm/AroraS98 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F273865.273901 (xsd:string)
dcterms:issued 1998 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label Probabilistic Checking of Proofs: A New Characterization of NP. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sanjeev_Arora>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Shmuel_Safra>
swrc:number 1 (xsd:string)
swrc:pages 70-122 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jacm/AroraS98/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jacm/AroraS98>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jacm/jacm45.html#AroraS98>
rdfs:seeAlso <https://doi.org/10.1145/273865.273901>
dc:subject NP-completeness, approximation algorithms, complexity hierarchies, computations on polynomials and finite fields, error-correcting codes, hardness of approximations, interactive computation, probabilistic computation, proof checking, reducibility and completeness, trade-offs/relations among complexity measures (xsd:string)
dc:title Probabilistic Checking of Proofs: A New Characterization of NP. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 45 (xsd:string)