Bounded-variable fixpoint queries are PSPACE-complete

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

Volumn 1258, Issue , 1997, Pages 89-105

  Dziembowski, Stefan ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING; RECONFIGURABLE HARDWARE;

BOUNDED VARIABLES; FINITE DATABASE; FIXPOINTS; PSPACE-COMPLETE; QUERY EVALUATION; RELATIONAL DATABASE; UPPER BOUND;

COMPUTER CIRCUITS;

EID: 0346392904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_34     Document Type: Conference Paper

References (10)

1. S.R. Buss. The boolean formula value problem is in ALOGTIME. In Pro­ceedings of the 19th Annual ACM Symposium on Theory of Computing (New York City, May 25-27, 1987), pages 123-131, New York, 1987. ACM, ACM Press.
2. A. Chandra and D. Harel. Structure and complexity of relational queries. J. Comput. Syst. Set., 25(1):99-128, August 1982.
3. S. Dziembowski, M. Jurdzinski, and D. Niwiriski. On the expression complex­ity of the modal µ-calculus model checking, unpublished manuscript, 1996.
4. E. A. Emerson, C. S. Jutla, and A. Sistla. On model-checking for fragments of n calculus. In CAV’93, volume 679 of LNCS, pages 385-396, 1993.
5. D. Kozen. Results on the prepositional /j-calculus. Theor. Comput. Set., 27(3):333-354, 1983.
6. N. Lynch. Log space recognition and translation of parenthesis languages. J. ACM, 24:583-590, 1977.
7. A. Tarski. A lattice theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
8. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th Ann. ACM Symposium on Theory of Computing (San Francisco, CA), pages 137-146, New York, 1982. ACM, ACM Press.
9. M. Y. Vardi. On the complexity of bounded-variable queries. In Proceedings of the 14th ACM Symposium on Principles of Database Systems, pages 266-276, 1995.
10. Shipei Zhang, Oleg Sokolsky, and Scott A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 154-163, Paris, France, 4-7 July 1994. IEEE Computer Society Press.