The following pages link to Bruno Grenet (Q300880):
Displaying 22 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- On the complexity of the multivariate resultant (Q1939330) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- Symmetric determinantal representations in characteristic 2 (Q2637125) (← links)
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms (Q2819758) (← links)
- The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent (Q2911618) (← links)
- Factoring bivariate lacunary polynomials without heights (Q2963227) (← links)
- (Q3105511) (← links)
- Symmetric Determinantal Representation of Weakly-Skew Circuits (Q3113718) (← links)
- Computing low-degree factors of lacunary polynomials (Q3452398) (← links)
- Acceptable Complexity Measures of Theorems (Q3584056) (← links)
- The Multivariate Resultant Is NP-hard in Any Characteristic (Q3586107) (← links)
- Generic Reductions for In-place Polynomial Multiplication (Q5121106) (← links)
- Essentially optimal sparse polynomial multiplication (Q5145974) (← links)
- Fast in-place algorithms for polynomial operations (Q5145975) (← links)
- Lacunaryx (Q5270184) (← links)
- One (more) line on the most ancient algorithm in history (Q6538725) (← links)
- Random primes without primality testing (Q6665755) (← links)
- Sparse polynomial interpolation and division in soft-linear time (Q6665785) (← links)
- On exact division and divisibility testing for sparse polynomials (Q6666532) (← links)
