Pages that link to "Item:Q1822977"
From MaRDI portal
The following pages link to Lower bounds for the complexity of polynomials (Q1822977):
Displaying 17 items.
- Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials (Q332332) (← links)
- The black-box query complexity of polynomial summation (Q626615) (← links)
- Lower bounds for polynomials of many variables (Q680071) (← links)
- On polynomials with symmetric Galois group which are easy to compute (Q1098889) (← links)
- Easy lower bound for a strange computational model (Q1377572) (← links)
- On lower bounds for the complexity of polynomials and their multiples (Q1587343) (← links)
- Ulrich complexity (Q1679674) (← links)
- On the representation of rational functions of bounded complexity (Q1822978) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Lower bounds of complexity for polarized polynomials over finite fields (Q2002473) (← links)
- Tight worst-case bounds for polynomial loop programs (Q2289065) (← links)
- (Q3783560) (← links)
- (Q4537179) (← links)
- Minkowski Complexity of Sets: An Easy Lower Bound (Q4575425) (← links)
- (Q4601823) (← links)
- (Q5371447) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
