Proving that prBPP=prP is as hard as "almost" proving that P ‚Č† NP. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/eccc/Tell18>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Roei_Tell>
foaf:homepage	<https://eccc.weizmann.ac.il/report/2018/003>
dc:identifier	DBLP journals/eccc/Tell18 (xsd:string)
dcterms:issued	2018 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/eccc>
rdfs:label	Proving that prBPP=prP is as hard as "almost" proving that P ‚Č† NP. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Roei_Tell>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/eccc/Tell18/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/eccc/Tell18>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/eccc/eccc25.html#Tell18>
rdfs:seeAlso	<https://eccc.weizmann.ac.il/report/2018/003>
dc:title	Proving that prBPP=prP is as hard as "almost" proving that P ‚Č† NP. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	TR18 (xsd:string)