Is it Easier to Prove Theorems that are Guaranteed to be True

October 15, 2021

2021   ·   cryptography     ·   fall-2021  

Speaker

Muthu Venkitasubramaniam October 15, 2021.

Abstract



Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • Hardness Condensation and Log Approximate Rank Conjecture
  • Reconstructing Graphs from Random Subgraphs.
  • Demystifying the border of depth-3 algebraic circuits
  • Simulation extractability of Fiat-Shamir transformation of multi-round protocols
  • Depth Tradeoffs for Clique and Connectivity