Sign in

Succinct NP Proofs from an Extractability Assumption.

Giovanni Di CrescenzoHelger Lipmaa
Published in: CiE (2008)
Keyphrases
  • computational complexity
  • np complete
  • theorem proving
  • universal relation
  • information retrieval
  • probability distribution
  • theorem prover
  • formal proof