scientific article
From MaRDI portal
Publication:2754200
zbMath0973.68081MaRDI QIDQ2754200
Publication date: 11 November 2001
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 (9)
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings ⋮ Interpolation in Valiant's theory ⋮ On sparseness and Turing reducibility over the reals ⋮ An explicit solution to Post's problem over the reals ⋮ Finding a vector orthogonal to roughly half a collection of vectors ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Sparse NP-complete problems over the reals with addition ⋮ On sparseness, reducibilities, and complexity ⋮ A hierarchy below the halting problem for additive machines
This page was built for publication:
