Complexity lower bounds for computation trees with elementary transcendental function gates
From MaRDI portal
(Redirected from Publication:1365876)
Recommendations
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
- Lower bounds on testing membership to a polyhedron by algebraic decision trees
- On topological lower bounds for algebraic computation trees
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
Cites work
- scientific article; zbMATH DE number 3940124 (Why is no real title available?)
- scientific article; zbMATH DE number 3949600 (Why is no real title available?)
- scientific article; zbMATH DE number 49991 (Why is no real title available?)
- scientific article; zbMATH DE number 51597 (Why is no real title available?)
- scientific article; zbMATH DE number 3559571 (Why is no real title available?)
- scientific article; zbMATH DE number 1256662 (Why is no real title available?)
- scientific article; zbMATH DE number 647665 (Why is no real title available?)
- scientific article; zbMATH DE number 727439 (Why is no real title available?)
- Complements of subanalytic sets and existential formulas for analytic functions
- Complexity lower bounds for computation trees with elementary transcendental function gates
- Complexity of deciding Tarski algebra
- Complexity of stratifications of semi-Pfaffian sets
- Decision tree complexity and Betti numbers
- Finding irreducible components of some real transcendental varieties
- Lower bounds on testing membership to a polyhedron by algebraic decision trees
- On Computing Algebraic Functions Using Logarithms and Exponentials
- On the Betti Numbers of Real Varieties
- On the Polyhedral Decision Problem
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Real-Analytic Desingularization and Subanalytic Sets: An Elementary Approach
- Semianalytic and subanalytic sets
- Solving systems of polynomial inequalities in subexponential time
- Sur la complexité du principe de Tarski-Seidenberg
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Topological Properties of Subanalytic Sets
Cited in
(8)- Randomization and the computational power of analytic and algebraic decision trees
- Instability, complexity, and evolution
- Complexity lower bounds for computation trees with elementary transcendental function gates
- On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
- Rough analysis of computation trees
- Complexity of gene circuits, Pfaffian functions and the morphogenesis problem.
- Algorithms and complexity in biological pattern formation problems
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
This page was built for publication: Complexity lower bounds for computation trees with elementary transcendental function gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365876)
