Author:
Krajı́ček Jan,Pudlák Pavel
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference30 articles.
1. RSA and Rabin functions: Certain parts are as hard as the whole;Alexi;SIAM J. Comp.,1988
2. Lower bounds for cutting planes proofs with small coefficients;Bonet;J. Symbolic Logic,1997
3. Bounded Arithmetic;Buss,1986
4. Using the Groebner basis algorithm to find proofs of unsatisfiability;Clegg,1996
5. Feasibly constructive proofs and the propositional calculus;Cook,1975
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Information in propositional proofs and algorithmic proof search;The Journal of Symbolic Logic;2021-09-27
3. Strong co-nondeterministic lower bounds for NP cannot be proved feasibly;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
4. Automating algebraic proof systems is NP-hard;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Typical forcings, NP search problems and an extension of a theorem of Riis;Annals of Pure and Applied Logic;2021-04