The following pages link to Algorithmic polynomials (Q5230299):
Displaying 21 items.
- Algorithmic problems for differential polynomial algebras (Q267385) (← links)
- An Egyptian algorithm for polynomials (Q801112) (← links)
- Polynomial algorithms in computer algebra (Q1912495) (← links)
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (Q2258082) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- Dual polynomials for collision and element distinctness (Q2830865) (← links)
- Algorithms for Symbolic Polynomials (Q3511124) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- (Q3750498) (← links)
- (Q4708434) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- (Q5092483) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5230298) (← links)
- Variation on Euclid's algorithm for polynomials (Q5439387) (← links)
- Algorithm for computing the truncation of the discriminant of a polynomial (Q6043784) (← links)
- (Q6176153) (← links)
