Author:
Borchert Bernd,Lange Klaus-Jörn,Stephan Frank,Tesson Pascal,Thérien Denis
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Baker, T.P., Gill, J., Solovay, R.: Relativizations of the P =? NP Question. SIAM J. Computing 4, 431–442 (1975)
2. Barrington, D., Thérien, D.: Finite Monoids and the Fine Structure of NC
1. J. of the ACM 35(4), 941–952 (1988)
3. Borchert, B., Kuske, D., Stephan, F.: On existentially first-order definable languages and their relation to NP. Theoret. Informatics Appl. 33, 259–269 (1999)
4. Borchert, B., Schmitz, H., Stephan, F.:
${\rm Leaf}^P(\Delta_2^B) = \Delta_2^p$
(1999) (unpublished manuscript)
5. Bovet, D.P., Crescenzi, P., Silvestri, R.: A uniform approach to define complexity classes. Theoretical Computer Science 104, 263–283 (1992)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SIGACT news complexity theory column 64;ACM SIGACT News;2009-09-25
2. Leaf Language Classes;Lecture Notes in Computer Science;2005