scientific article; zbMATH DE number 5204622
From MaRDI portal
Publication:5421717
zbMath1149.68033MaRDI QIDQ5421717
Publication date: 24 October 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Intractability and the use of heuristics in psychological explanations ⋮ Randomness – A Computational Complexity Perspective ⋮ Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ Arithmetic Circuits: A Chasm at Depth 3
This page was built for publication: