Sign Up for Student Presentations
Implications of full derandomization including Graph Iso in NP ∩ co-NP under reasonable assumptions
Lecture Notes by Peter Ralli
Private coins versus public coins in interactive proof systems by Goldwasser and Sipser
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses by Klivans and van Melkebeek
No comments:
Post a Comment