Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Multi-prover encoding schemes and three-prover proof systems

From MaRDI portal
Publication:1816732
Jump to:navigation, search

DOI10.1006/jcss.1996.0066zbMath0861.68089OpenAlexW2136037917MaRDI QIDQ1816732

Gábor Tardos

Publication date: 11 May 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9df89975850bfe3f859dfb06a97a83ef6807b6e3


zbMATH Keywords

multi-prover encoding schemesparallel repetition conjecture


Mathematics Subject Classification ID


Related Items (1)

The complexity of approximating a nonlinear program







This page was built for publication: Multi-prover encoding schemes and three-prover proof systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1816732&oldid=14178156"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki