Author:
Niedermeier Rolf,Rossmanith Peter
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. R. Beigel, J. Gill, and U. Hertrampf. Counting classes: Threshold, parity, mods, and fewness. In Proc. of 7th STACS, number 415 in LNCS, pages 49–57. Springer, 1990.
2. G. Buntrock, L. A. Hemachandra, and D. Siefkes. Using inductive counting to simulate nondeterministic computation. In Proc. of 15th MFCS, number 452 in LNCS, pages 187–194. Springer, 1990. (to appear in Information and Computation).
3. J.-Y. Cai, L. Hemachandra, and J. Vyskoč. Promise problems and access to unambiguous computation. In Proc. of 17th MFCS, number 629 in LNCS, pages 162–171. Springer, 1992.
4. S. Even, A. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Inform. and Control, 61(2):159–173, 1984.
5. S. A. Fenner, L. J. Fortnow, and S. A. Kurtz. Gap-definable counting classes. In Proc. of 6th Conference on Structure in Complexity Theory, pages 30–42, 1991.