Back to Results
First PageMeta Content
Computational 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 List

Document Date: 2017-11-11 14:59:54

Open Document

File Size: 490,90 KB

Share Result on Facebook