×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [nonisomorphic graphs]
Proving Without Explaining, and Checking Without Understanding Scott Aaronson (MIT) Symposium on Proof, UPenn, Nov. 9, 2012 Looks good to me!
231 views
Dana Moshkovitz. Back to NP L NP iff members have short, efficiently checkable, certificates of membership. Is satisfiable? x 1 = truex 11 = true
218 views
Interactive Protocols
81 views