scientific article; zbMATH DE number 1500505
From MaRDI portal
Publication:4501520
zbMath0959.68045MaRDI QIDQ4501520
Publication date: 4 September 2000
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)
Finding a vector orthogonal to roughly half a collection of vectors ⋮ Some lower bounds for the complexity of the linear programming feasibility problem over the reals ⋮ VPSPACE and a transfer theorem over the complex field ⋮ Transfer theorems via sign conditions
This page was built for publication:
