Properties of uniformly hard languages
From MaRDI portal
Publication:1041777
DOI10.1016/J.IPL.2004.11.014zbMath1185.68357OpenAlexW2072485606MaRDI QIDQ1041777
Janusz Jarosz, Piotr Faliszewski
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.014
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
This page was built for publication: Properties of uniformly hard languages