Length-Increasing Reductions for PSPACE-Completeness

DOI10.1007/978-3-642-40313-2_48zbMath1398.68182OpenAlexW176257112MaRDI QIDQ2849941

A. Pavan, John M. Hitchcock

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_48

zbMATH Keywords

computational complexitycompletenessPSPACElength-increasing reductions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Length-Increasing Reductions for PSPACE-Completeness