On the amount of nondeterminism and the power of verifying

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 733-750

  Cai, Liming ^a   Chen, Jianbr ^b  

^a Ohio University   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Complete languages; Computational complexity; Computational optimization; Nondeterminism

Indexed keywords

EID: 0000491637     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793258295     Document Type: Article

References (27)

1. A. AGGARWAL, A. K. CHANDRA, AND M. SNIR, Hierarchical memory with block transfer, in Proc. 28th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 204-216.
2. 1, J. Comput. System Sci., 41 (1990), pp. 274-306.
3. R. B. BOPPANA AND M. SIPSER, The complexity of finite functions, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., MIT Press, Cambridge, MA, 1990, pp. 757-804.
4. A. BORODIN, On relating time and space to size and depth, SIAM J. Comput., 6 (1977), pp. 733-744.
5. J. F. BUSS AND J. GOLDSMITH, Nondeterminism within P, SIAM J. Comput., 22 (1993), pp. 560-572.
6. L. CAI, Nondeterminism and optimization, Ph.D. thesis, Department of Computer Science, Texas A&M University, College Station, TX, 1994.
7. L. CAI AND J. CHEN, On input read-modes of alternating Turing machines, Theoret. Comput. Sci., 148 (1995), pp. 33-55.
8. L. CAI AND J. CHEN, On the amount of nondeterminism and the power of verifying, in Proc. 18th International Symposium on Mathematical Foundations of Computer Science (MFCS '93), Lecture Notes in Comput. Sci. 711, Springer-Verlag, Berlin, 1993, pp. 311-320.
9. L. CAI AND J. CHEN, Fixed parameter tractability and approximability of NP-hard optimization problems, in Proc. 2nd Israel Symposium on Theory and Computing Systems, Springer-Verlag, Berlin, 1993, pp. 118-126.
10. L. CAI AND J. CHEN, R. DOWNEY, AND M. FELLOWS, On the structure of parameterized problems in NP, Inform. and Comput., 123 (1995), pp. 38-49.
11. A. K. CHANDRA, D. C. KOZEN, AND L. J. STOCKMEYER, Alternation, J. Assoc. Comput. Mach., 28 (1981), pp. 114-133.
12. J. CHEN, Characterizing parallel hierarchies by reducibilities, Inform. Process. Lett., 39 (1991), pp. 303-307.
13. S. A. COOK AND H. J. HOOVER, A depth-universal circuit, SIAM J. Comput., 14 (1985), pp. 833-839.
14. J. DÍAZ, AND J. TORÁN, Classes of bounded nondeterminism, Math. System Theory, 23 (1990), pp. 21-32.
15. R. G. DOWNEY AND M. R. FELLOWS, Fixed-parameter intractability, in Proc. 7th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 36-49.
16. G. FARR, On problems with short certificates, Acta Inform., 31 (1994), pp. 479-502.
17. M. FISCHER AND N. J. PIPPENGER, Relations among complexity measures, J. Assoc. Comput. Mach, 26 (1979), pp. 361-381.
18. D. S. JOHNSON, The NP-completeness column: An ongoing guide, J. Algorithms, 13 (1992), pp. 502-524.
19. C. KINTALA AND P. FISHER, Refining nondeterminism in relativized complexity classes, SIAM J. Comput., 13 (1984), pp. 329-337.
20. N. MEGGIDO AND U. VISHKIN, On finding a minimum dominating set in a tournament, Theoret. Comput. Sci. 61 (1988), pp. 307-316.
21. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the V-C dimension, in Proc. 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 12-18.
22. N. J. PIPPENGER, Fast simulation of combinational logic networks by machines without random-access storage, in Proc. 15th Allerton Conference on Communication, Control, and Computing, 1977, pp. 25-33.
23. W. L. RUZZO, On uniform circuit complexity, J. Comput. System Sci., 21 (1981), pp. 365-383.
24. k-complete problems and greediness, Technical Report 455, Computer Science Department, University of Rochester, Rochester, NY, 1993.
25. M. J. WOLF, Nondeterministic circuits, space complexity, and quasigroups, Theoret. Comput. Sci., 125 (1994), pp. 295-313.
26. M. YANNAKAKIS, private communications, 1993.
27. A. YAO, Separating the polynomial-time hierarchy by oracles, in Proc. 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 1-10.