The following pages link to (Q3135191):
Displaying 6 items.
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- Sparse shifts for univariate polynomials (Q1924546) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- (Q4888611) (← links)
