Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
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.0066zbMATH Open0861.68089OpenAlexW2136037917MaRDI QIDQ1816732FDOQ1816732


Authors: Gábor Tardos Edit this on Wikidata


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




Recommendations

  • On the power of multi-prover interactive protocols
  • scientific article; zbMATH DE number 512981
  • Two prover protocols, low error at affordable rates


zbMATH Keywords

multi-prover encoding schemesparallel repetition conjecture


Mathematics Subject Classification ID



Cited In (1)

  • The complexity of approximating a nonlinear program





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816732)

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