A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the virtue of succinct proofs

2012
*
Proceedings of the 44th symposium on Theory of Computing - STOC '12
*

An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size and space. Such questions were originally motivated by practical SAT solving, but have also led to the development of new theoretical concepts in proof complexity of intrinsic interest and to results establishing nontrivial relations between space and other proof complexity measures. By now, the resolution proof system is fairly well understood in this regard, as

doi:10.1145/2213977.2214000
dblp:conf/stoc/HuynhN12
fatcat:il3fpwscg5crjle2mnnbm3jihq