On the interplay between proof complexity and SAT solving.

Jakob Nordström

Published in: ACM SIGLOG News (2015)

Keyphrases

sat solving
sat solvers
computational complexity
sat problem
boolean satisfiability
dynamic programming
search tree
theorem prover
space complexity