![Computational complexity theory / Logic / Mathematics / Randomized algorithms / Automated theorem proving / Logic programming / Probabilistically checkable proof / IP / NP / Substitution / MAX-3SAT / operator Computational complexity theory / Logic / Mathematics / Randomized algorithms / Automated theorem proving / Logic programming / Probabilistically checkable proof / IP / NP / Substitution / MAX-3SAT / operator](https://www.pdfsearch.io/img/70ee3ac14ada118b31bf4b70b1d9d6ec.jpg) Date: 2017-11-11 14:59:54Computational complexity theory Logic Mathematics Randomized algorithms Automated theorem proving Logic programming Probabilistically checkable proof IP NP Substitution MAX-3SAT operator | | Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at Add to Reading ListSource URL: www.pepper-project.orgDownload Document from Source Website File Size: 490,90 KBShare Document on Facebook
|