Length-Increasing Reductions for PSPACE-Completeness
From MaRDI portal
Publication:2849941
DOI10.1007/978-3-642-40313-2_48zbMath1398.68182MaRDI QIDQ2849941
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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)