Pages that link to "Item:Q1803554"
From MaRDI portal
The following pages link to Lower bounds for arithmetic networks (Q1803554):
Displayed 20 items.
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Complexity lower bounds for approximation algebraic computation trees (Q1578509) (← links)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations (Q2379679) (← links)
- Topological lower bounds for arithmetic networks (Q2410689) (← links)
- On a real analog of Bezout inequality and the number of connected components of sign conditions (Q2795904) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)
- Decision tree complexity and Betti numbers (Q5906824) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)