On the concrete efficiency of probabilistically-checkable proofs.

Eli Ben-Sasson Alessandro Chiesa Daniel Genkin Eran Tromer

Published in: STOC (2013)

Keyphrases

theorem proving
information retrieval
genetic algorithm
learning algorithm
knowledge base
website
high level
database systems
hidden markov models
logic programs
theorem prover
highly efficient