Pages that link to "Item:Q1386175"
From MaRDI portal
The following pages link to Lower bounds for polynomial evaluation and interpolation problems (Q1386175):
Displaying 20 items.
- Lower bounds by Birkhoff interpolation (Q511113) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Lower bounds for the polynomial calculus (Q1293358) (← links)
- On the rigidity of Vandermonde matrices (Q1566747) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle (Q2378541) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- On Improved Degree Lower Bounds for Polynomial Approximation. (Q2963913) (← links)
- (Q4464663) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
- Hay from the haystack: explicit examples of exponential quantum circuit complexity (Q6109366) (← links)
- Improving \(3N\) circuit complexity lower bounds (Q6184294) (← links)
- Determinants vs. algebraic branching programs (Q6624427) (← links)
