Unary Coded NP-Complete Languages in ASPACE (log log n)

DOI10.1007/978-3-642-31653-1_16zbMath1316.68062MaRDI QIDQ3167493

Viliam Geffert, Dana Pardubská

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_16

zbMATH Keywords

complexity theory; sublogarithmic space; binary and unary languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)