Author:
Borchert Bernd,Kuske Dietrich,Stephan Frank
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. R. Beigel, J. Gill: Counting classes: thresholds, parity, mods, and fewness, Theoretical Computer Science 103, 1992, pp. 3–23.
2. A. Blass, Y. Gurevich: On the unique satisfiability problem, Information and Control 55, 1982, pp. 80–88.
3. B. Borchert: On the acceptance power of regular languages, Theoretical Computer Science 148, 1995, pp. 207–225.
4. D. P. Bovet, P. Crescenzi, R. Silvestri: A uniform approach to define complexity classes, Theoretical Computer Science 104, 1992, pp. 263–283.
5. H.-J. Burtschick, H. Vollmer: Lindström Quantifiers and Leaf Language Definability, ECCC Report TR96-005, 1996.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献