Author:
Beyersdorff Olaf,Köbler Johannes,Müller Sebastian
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Cook, S.A., Krajíček, J.: Consequences of the provability of
$\mathit{NP} \subseteq P/\mathit{poly}$
. The Journal of Symbolic Logic 72(4), 1353–1371 (2007)
2. Lecture Notes in Computer Science;O. Beyersdorff,2008
3. Orponen, P., Ko, K., Schöning, U., Watanabe, O.: Instance complexity. Journal of the ACM 41(1), 96–121 (1994)
4. Lecture Notes in Computer Science;V. Arvind,2000
5. Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th ACM Symposium on Theory of Computing, pp. 302–309. ACM Press, New York (1980)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the computational complexity of finding hard tautologies;Bulletin of the London Mathematical Society;2013-10-06
2. Proof systems that take advice;Information and Computation;2011-03
3. A tight Karp-Lipton collapse result in bounded arithmetic;ACM Transactions on Computational Logic;2010-07
4. Different Approaches to Proof Systems;Lecture Notes in Computer Science;2010
5. Optimal Acceptors and Optimal Proof Systems;Lecture Notes in Computer Science;2010