Abstract
Polynomial Space is the largest complexity class studied in this book. It consists of what we could compute with a feasible amount of hardware, but with no time limit. PSPACE has several apparently quite different descriptive characterizations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Immerman, N. (1999). Polynomial Space. In: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0539-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0539-5_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6809-3
Online ISBN: 978-1-4612-0539-5
eBook Packages: Springer Book Archive