On the complexity of finding falsifying assignments for Herbrand disjunctions
暂无分享,去创建一个
[1] Pavel Pudlk. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction , 2013 .
[2] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.
[3] S. Buss,et al. An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic , 1994 .
[4] P. Pudlák. On the length of proofs of finitistic consistency statements in first order theories , 1986 .
[5] Neil Thapen,et al. The provably total search problems of bounded arithmetic , 2011 .
[6] Samuel R. Buss,et al. On Herbrand's Theorem , 1994, LCC.
[7] Pavel Pudlák. Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction , 2013, Springer monographs in mathematics.
[8] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[9] Samuel R. Buss,et al. Chapter I - An Introduction to Proof Theory , 1998 .