Strict sequential P-completeness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 329-338

  Reinhardt, Klaus ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

P-COMPLETE; P-COMPLETENESS; PARALLELIZATIONS; SEQUENTIAL ALGORITHM; SEQUENTIALITY; STACK MACHINES;

POLYNOMIALS;

EID: 84949651278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023470     Document Type: Conference Paper

References (10)

1. [Con92] A. Condon. A theory of strict P-completeness. In Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, number 577 in Lecture Notes in Computer Science, pages 33-44. Springer-Verlag, 1992.
2. [Con94] A. Condon. A theory of strict P-completeness. Computational Complexity, 4:220-241, 1994.
3. [Coo85] S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985.
4. [FLR96] H. Fernau, K.-J. Lange, and K. Reinhardt. Advocating ownership. In V. Chandru, editor, Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 286-297. Springer, December 1996.
5. [GHR95] R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to parallel computation: P-completeness theory. New York u.a., Oxford Univ. Pr., 1995.
6. [HU79] J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
7. [KRS90] C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71:95-132, 1990.
8. [LN93] K.-J. Lange and R. Niedermeier. Data-independences of parallel random access machines. In R. K. Shyamasundar, editor, Proceedings of the 13th Conference on Foundations of Software Technology and Theory of Computer Science, number 761 in Lecture Notes in Computer Science, pages 104-113, Bombay, India, December 1993. Springer-Verlag.
9. [VS86] J. S. Vitter and R. A. Simons. New classes for parallel complexity: A study of unification and other complete problems for P. IEEE Transactions on Computers, C-35(5):403-418, 1986.
10. [Wie90] J. Wiedermann. Normalizing and accelerating RAM computations and the problem of reasonable space measures. In M.S. Paterson, editor, Proceedings of the 17th ICALP (Warwick University, England, July 1990), LNCS 443, pages 125-138. EATCS, Springer-Verlag, 1990.