[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/focm/Meer05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Klaus_Meer>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs10208-005-0142-1>
foaf:homepage <https://doi.org/10.1007/s10208-005-0142-1>
dc:identifier DBLP journals/focm/Meer05 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs10208-005-0142-1 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/focm>
rdfs:label Transparent Long Proofs: A First PCP Theorem for NPR. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Klaus_Meer>
swrc:number 3 (xsd:string)
swrc:pages 231-255 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/focm/Meer05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/focm/Meer05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/focm/focm5.html#Meer05>
rdfs:seeAlso <https://doi.org/10.1007/s10208-005-0142-1>
dc:subject Real number complexity; Probabilistically checkable proofs; Verifiers (xsd:string)
dc:title Transparent Long Proofs: A First PCP Theorem for NPR. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 5 (xsd:string)