Non-signaling proofs with o(√ log n) provers are in PSPACE.
Dhiraj HoldenYael Tauman KalaiPublished in: STOC (2020)
Keyphrases
- theorem proving
- theorem prover
- decision procedures
- proof search
- automated reasoning
- inference rules
- first order logic
- worst case
- lower bound
- computer algebra
- formal proof
- natural deduction
- mathematical proofs
- mazurkiewicz traces
- formal proofs
- temporal logic
- data structure
- proof procedure
- pspace complete
- conjunctive queries
- optimal solution
- web services
- computer vision
- information retrieval