Round Complexity Versus Randomness Complexity in Interactive Proofs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/toc/Leshkowitz22>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Maya_Leshkowitz>
foaf:homepage	<https://theoryofcomputing.org/articles/v018a013/>
dc:identifier	DBLP journals/toc/Leshkowitz22 (xsd:string)
dcterms:issued	2022 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/toc>
rdfs:label	Round Complexity Versus Randomness Complexity in Interactive Proofs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Maya_Leshkowitz>
swrc:pages	1-65 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/toc/Leshkowitz22/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/toc/Leshkowitz22>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/toc/toc18.html#Leshkowitz22>
rdfs:seeAlso	<https://theoryofcomputing.org/articles/v018a013/>
dc:title	Round Complexity Versus Randomness Complexity in Interactive Proofs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	18 (xsd:string)