scientific article; zbMATH DE number 1256662
From MaRDI portal
Publication:4230349
zbMath0977.68556MaRDI QIDQ4230349
Publication date: 21 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Complexity lower bounds for computation trees with elementary transcendental function gates ⋮ Lower bounds for arithmetic networks. II: Sum of Betti numbers ⋮ Semi-algebraic decision complexity, the real spectrum, and degree ⋮ A computationally intractable problem on simplicial complexes ⋮ A lower bound for randomized algebraic decision trees ⋮ Randomization and the computational power of analytic and algebraic decision trees ⋮ Time and space complexity of deterministic and nondeterministic decision trees ⋮ Lower bound on testing membership to a polyhedron by algebraic decision and computation trees ⋮ Decision trees: Old and new results.
This page was built for publication:
