The following pages link to (Q3973344):
Displaying 12 items.
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- A measure for semialgebraic sets related to Boolean complexity (Q1262914) (← links)
- A note on Rabin's width of a complete proof (Q1327592) (← links)
- Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
- Lower bounds for arithmetic networks (Q1803554) (← links)
- Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations (Q3520053) (← links)
- On lack of effectiveness in semi-algebraic geometry (Q3973328) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)