Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem

DOI10.1007/978-3-662-44522-8_16zbMath1425.68141OpenAlexW2182677559MaRDI QIDQ2922013

Moritz Müller, Yijia Chen

Publication date: 14 October 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Unnamed Item ⋮ The parameterized space complexity of embedding along a path

This page was built for publication: Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem