Lower bounds for arithmetic networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 16658 (Why is no real title available?)
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 176763 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3564333 (Why is no real title available?)
- scientific article; zbMATH DE number 1142301 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- Complexity of deciding Tarski algebra
- Definability and fast quantifier elimination in algebraically closed fields
- Lower bounds in algebraic computational complexity
- Maximal bilinear complexity and codes
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Betti Numbers of Real Varieties
- On the topology of algorithms. I
- Proving simultaneous positivity of linear forms
- Real quantifier elimination is doubly exponential
- TIME BOUNDED COMPUTATIONS OVER THE REALS
Cited in
(22)- Semi-algebraic decision complexity, the real spectrum, and degree
- On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
- On defining integers and proving arithmetic circuit lower bounds
- On the parallel complexity of the polynomial ideal membership problem
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
- Kronecker's and Newton's approaches to solving: a first comparison
- Lower bounds for arithmetic networks. II: Sum of Betti numbers
- An alternative to Ben-Or's lower bound for the knapsack problem complexity
- On the computation of Boolean functions by analog circuits of bounded fan-in
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Time-space tradeoffs in algebraic complexity theory
- Nearly sharp complexity bounds for multiprocessor algebraic computations
- A size-depth trade-off for the analog computation of Boolean functions
- Straight-line programs in geometric elimination theory
- Decision tree complexity and Betti numbers
- Generalized Knapsack problems and fixed degree separations
- On a real analog of Bézout inequality and the number of connected components of sign conditions
- Lower bounds for diophantine approximations
- Complexity lower bounds for approximation algebraic computation trees
- Topological lower bounds for arithmetic networks
- scientific article; zbMATH DE number 1775437 (Why is no real title available?)
This page was built for publication: Lower bounds for arithmetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803554)
