A reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems.
Jan KrajícekPublished in: CoRR (2013)
Keyphrases
- computational complexity
- complexity reduction
- low complexity
- memory requirements
- special case
- building blocks
- computationally efficient
- high computational complexity
- learning systems
- computational cost
- expert systems
- intelligent systems
- data sets
- distributed systems
- complex systems
- search space
- theorem proving
- arc consistency
- case study
- lower complexity
- information systems