Stefan Dziembowski. Bounded-Variable Fixpoint Queries are PSPACE-complete. In Dirk van Dalen, Marc Bezem, editors, Computer Science Logic, 10th International Workshop, CSL 96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers. Volume 1258 of Lecture Notes in Computer Science, pages 89-105, Springer, 1996.
@inproceedings{Dziembowski96,
title = {Bounded-Variable Fixpoint Queries are PSPACE-complete},
author = {Stefan Dziembowski},
year = {1996},
tags = {completeness},
researchr = {https://researchr.org/publication/Dziembowski96},
cites = {0},
citedby = {0},
pages = {89-105},
booktitle = {Computer Science Logic, 10th International Workshop, CSL 96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers},
editor = {Dirk van Dalen and Marc Bezem},
volume = {1258},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63172-0},
}