Bounded-variable fixpoint queries are PSPACE-complete

This publication has 6 references indexed in Scilit:

• On the complexity of bounded-variable queries (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1995
• On model-checking for fragments of μ-calculus
  Published by Springer Nature ,1993
• Results on the propositional μ-calculus
  Theoretical Computer Science, 1983
• Structure and complexity of relational queries
  Journal of Computer and System Sciences, 1982
• Log Space Recognition and Translation of Parenthesis Languages
  Journal of the ACM, 1977
• A lattice-theoretical fixpoint theorem and its applications
  Pacific Journal of Mathematics, 1955