Author:
Arvind Vikraman,Köbler Johannes,Mundhenk Martin,Torán Jacobo
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. J. L. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.
2. P. Beame and T. Pitassi, Propositional proof complexity: past, present, and future, ECCC Report TR98-067, 1998.
3. Lect Notes Comput Sci;H. Buhrman,1997
4. S. A. Cook and R. A. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic, 44(1):36–50, 1979.
5. L. Fortnow and M. Kummer, On resource-bounded instance complexity, Theoretical Computer Science A, 161:123–140, 1996.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献