Sharply bounded alternation and quasilinear time

Theory of Computing Systems

Volumn 31, Issue 2, 1998, Pages 187-214

  Bloch, S A ^a   Buss, J F ^b   Goldsmith, J ^c  

^a ADELPHI UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TURING MACHINES;

ALTERNATING TURING MACHINES; COMPLETE PROBLEMS; FIRST ORDER DEFINABILITY; FUNCTION CLASS; LIMITED NONDETERMINISM; QUASI-LINEAR TIME; RECURSIONS;

CHARACTERIZATION;

EID: 0032394741     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000085     Document Type: Article

References (57)

1. K.A. Abrahamson, R.G. Downey, and M.R. Fellows, Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73 (1995), 235-276.
2. C. Álvarez, J. Díaz, and J. Torán, Complexity classes with complete problems between P and NP-complete, in Foundations of Computation Theory, Lecture Notes in Computer Science, Vol. 380, Springer-Verlag, Berlin, 1989, pp. 13-24.
3. 1, J. Comput. System Sci. 41 (1990), 274-306.
4. R. Beigel and J. Goldsmith, Downward separation fails catastrophically for limited nondeterminism classes, in Proceedings of the Ninth Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 134-138. Also to appear in SIAM J. Comput.
5. S. Bellantoni, Predicative Recursion and Computational Complexity. Ph.D. thesis, University of Toronto, 1992.
6. S. Bellantoni, Predicative recursion and the polytime hierarchy, in P. Clote and J.B. Remmel, eds., Feasible Mathematics II, Birkhäuser, Basel, 1995, pp. 15-29.
7. S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Comput. Complexity 2 ( 1992), 97-110.
8. J.H. Bennett, On Spectra, Ph.D. thesis, Department of Mathematics, Princeton University, 1962.
9. S.A. Bloch, Alternating Function Classes within P, Technical Report 92-16, Computer Science Dept., University of Manitoba, December 1992, 20pp.
10. S.A. Bloch, Function-algebraic characterizations of log and polylog parallel time, Comput. Complexity 4 (1994), 175-205. See also Proceedings of the Seventh Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 193-206.
11. S.A. Bloch, Function-algebraic characterizations of log and polylog parallel time, Comput. Complexity 4 (1994), 175-205. See also Proceedings of the Seventh Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 193-206.
12. J.F. Buss, Relativized alternation and space-bounded computation, J. Comput. System Sci. 36 (1988), 351-378.
13. J.F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput. 22 (1993), 560-572.
14. S.R. Buss, Bounded Arithmetic, Bibliopolis, Naples, 1986.
15. L. Cai and J. Chen, On the amount of nondeterminism and the power of verifying, SIAM J. Comput., 26 (1997), 733-750. See also Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin, 1993, pp. 311-320.
16. L. Cai and J. Chen, On the amount of nondeterminism and the power of verifying, SIAM J. Comput., 26 (1997), 733-750. See also Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin, 1993, pp. 311-320.
17. A. Chandra, D. Kozen, and L. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981), 114-133.
18. k, and NC, in S. Buss and P. Scott, eds., Feasible Mathematics, Perspectives in Computer Science, Birkhäuser, Basel, 1990, pp. 49-69.
19. A. Cobham, The intrinsic computational complexity of functions, in Y. Bar-Hillel, ed.. Logic, Methodology, and the Philosophy of Science: Proceedings of the 1964 International Congress, North-Holland, Amsterdam, 1965, pp. 24-30.
20. A. Condon, A theory of strict P-completeness, Comput. Complexity 4 (1994), 220-241.
21. S.A. Cook, Computational complexity of higher-type functions, in I. Satake, ed., Proceedings of the International Congress of Mathematicians, Springer-Verlag, New York, 1990, pp. 55-69.
22. J. Díaz and J. Torán, Classes of bounded nondeterminism, Math. Systems Theory 23 (1990), 21-32.
23. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness, I: basic results, SIAM J. Comput. 24 (1995), 873-921.
24. R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness, II: completeness for W[1], Theoret. Comput. Sci. 141 (1995), 109-131.
25. J. Edmonds, Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449-467.
26. N. Pippenger and M.J. Fischer, Relations among complexity measures, J. Assoc. Comput. Mach. 26 (1979), 361-381.
27. J. Girard, A. Scedrov, and P. Scott, Bounded linear logic: a modular approach to polynomial time computability, in S. Buss and P. Scott, eds., Feasible Mathematics, Perspectives in Computer Science, Birkhäuser, Basel, 1990, pp. 195-207.
28. E. Grädel, On the notion of linear-time computability, Internat. J. Foundat. Comput. Sci. 1 (1990), 295-307.
29. E. Grädel and G.L. McColm, Hierarchies in transitive-closure logic, stratified datalog, and infinitary logic, Ann. Pure Appl. Logic 77 (1996), 169-199.
30. R. Greenlaw, H.J. Hoover, and W.L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Oxford University Press, Oxford, 1995.
31. Y. Gurevich, Algebras of feasible functions, Proceedings of the 24th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 210-214.
32. Y. Gurevich, Logic and the challenge of computer science, in E. Börger, ed., Current Trends in Theoretical Computer Science, Computer Science Press, Los Alamitos, CA, 1987, pp. 1-57.
33. Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986), 265-280.
34. Y. Gurevich and S. Shelah, Nearly linear time, in A.R. Meyer and M.A. Taitslin, eds., Logic at Botik '89, Lecture Notes in Computer Science, Vol. 363, Springer-Verlag, Berlin, 1989, pp. 108-118.
35. J. Hartmanis, On non-determinacy in simple computing devices, Acta Inform. 1 (1972), 336-344.
36. L. Hemachandra and S. Jha, Defying upward and downward separation, in STACS 93: Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 665, Springer-Verlag, Berlin, 1993, pp. 185-195.
37. N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986), 86-104.
38. N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987), 760-778.
39. N. Immerman, Expressibility and parallel complexity, SIAM J. Comput. 18 (1989), 625-638.
40. N.D. Jones and W.T. Laaser, Complete problems for deterministic polynomial time, Theoret. Comput. Sci. 3 (1976), 105-117.
41. R.M. Karp, Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations, Plenum, New York, 1972, pp. 85-104.
42. C.M.R. Kintala and P.C. Fischer, Refining nondeterminism in relativized polynomial-time bounded computations, SIAM J. Comput. 9 (1980), 46-53.
43. D. Leivant, Subrecursion and lambda representation over free algebras, in S.R. Buss and P. Scott, eds., Feasible Mathematics, Perspectives in Computer Science, Birkhäuser, Basel, 1990, pp. 281-291.
44. D. Leivant, Inductive definitions over finite structures, Inform. and Comput. 89 (1990), 95-108.
45. D. Leivant, A foundational delineation of poly-time, Inform. and Control 110 (1994), 391-420.
46. N. Linial, Y. Mansour, and R.L. Rivest, Results on learnability and the Vapnik-Chervonenkis dimension, Inform. and Control 90 (1991), 33-49.
47. A.V. Naik, K.W. Regan, and D. Sivakumar, Quasilinear-time complexity theory, Theoret. Comput. Sci. 148 (1995), 325-350.
48. J. Otto, Tiers, Tensor, and the Linear-Time Hierarchy, lecture presented at the Workshop on Logic and Computational Complexity, Indiana University-Purdue University, Indianapolis, October 1994.
49. C.H. Papadimitriou, A note on the expressive power of PROLOG, Bull. EATCS 26 (1985), 21-23.
50. C.H. Papadimitriou, A.A. Schäffer, and M. Yannakakis, Simple local search problems that are hard to solve, SIAM J. Comput. 20 (1991), 56-87.
51. N. Pippenger, Fast simulation of combinational logic circuits by machines without random-access storage, in F.P. Preparata and M.B. Pursley, eds., Proceedings of the Fifteenth Allerton Conference on Communication. Control, and Computing, 1977, pp. 25-33.
52. K. Regan, Linear Time and Memory-Efficient Computation, Technical Report 92-28, Department of Computer Science, SUNY, Buffalo, NY, 1992.
53. 3-complete, in Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 77-85.
54. C.P. Schnorr, Satisfiability is quasilinear complete in NQL, J. Assoc. Comput. Mach. 25 (1978), 136-145.
55. V. Vapnik and A. Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
56. M. Vardi, Complexity and relational query languages, in Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 1982, pp. 137-146.
57. C. Wrathall, Rudimentary predicates and the linear-time hierarchy, SIAM J. Comput. 7 (1978), 194-209.