Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68384OpenAlexW2494705596MaRDI QIDQ5492867

Piotr Faliszewski, Ogihara, Mitsunori

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

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)

Related Items (1)

Sparse selfreducible sets and nonuniform lower bounds

This page was built for publication: Mathematical Foundations of Computer Science 2005