Author:
Krebs Andreas,Limaye Nutan,Mahajan Meena,Sreenivasaiah Karteek
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)
2. Lecture Notes in Computer Science;E.A. Hirsch,2010
3. Hirsch, E.A., Itsykson, D.: On optimal heuristic randomized semidecision procedures, with application to proof complexity. In: Proceedings of 27th International Symposium on Theoretical Aspects of Computer Science, STACS, pp. 453–464 (2010)
4. Cook, S.A., Krajíček, J.: Consequences of the provability of NP ⊆ P/poly. Journal of Symbolic Logic 72(4), 1353–1371 (2007)
5. Pudlák, P.: Quantum deduction rules. Ann. Pure Appl. Logic 157(1), 16–29 (2009), See also ECCC TR07-032