On the amount of nondeterminism and the power of verifying-Reference-Cited by-同舟云学术

On the amount of nondeterminism and the power of verifying

Published:1993 Issue: Volume: Page:311-320
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cai Liming,Chen Jianer

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57182-5_23

Reference16 articles.

1. K. Abrahamson, R. G. Downey and M. R. Fellows, Fixed-parameter intractability II, To appear in Proc. 10th Symposium on Theoretical Aspects of Computer Science, Wurzburg, Germany, (1993).

2. K. R. Abrahamson, J. A. Ellis, M. R. Fellows, and M. E. Mata, On the complexity of fixed parameter problems, Proc. 30th Annual Symposium on Foundations of Computer Science, (1989), pp. 210–215.

3. D. A. Barrington, N. Immerman, and H. Straubing, On uniformity within NC1, Journal of Computer and System Sciences 41, (1990), pp. 274–306.

4. S. R. Buss, The Boolean formula value problem is in ALOGTIME, Proc. 19th Annual ACM Symposium on Theory of Computing, (1987), pp. 123–131.

5. J. F. Buss and J. Goldsmith, Nondeterminism within P, Lecture Notes in Computer Science 480, (1991), pp. 348–359.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The M-Hierarchy, and XP-Optimality;Texts in Computer Science;2013

2. On log-time alternating Turing machines of alternation depth k;Lecture Notes in Computer Science;1995

3. On the structure of parameterized problems in NP;Lecture Notes in Computer Science;1994

4. The parameterized complexity of some problems in logic and linguistics;Logical Foundations of Computer Science;1994