Author:
Köbler Johannes,Watanabe Osamu
Publisher
Springer Berlin Heidelberg
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Reductions to Sparse Sets;Mathematical Foundations of Computer Science 2013;2013
2. ON HIGHER ARTHUR-MERLIN CLASSES;International Journal of Foundations of Computer Science;2004-02
3. On Higher Arthur-Merlin Classes;Lecture Notes in Computer Science;2002
4. Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy;Lecture Notes in Computer Science;1999
5. Average-case intractability vs. worst-case intractability;Mathematical Foundations of Computer Science 1998;1998