Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
- Bruno Grenet, J. Hoeven, Grégoire Lecerf
- Computer Science, MathematicsInternational Symposium on Symbolic and Algebraic…
- 24 June 2015
This work studies the problem of computing all roots of a polynomial that splits over Fq, which was one of the bottlenecks for fast sparse interpolation in practice, and revisits and slightly improves existing algorithms and then presents new randomized ones based on the Graeffe transform.
The Multivariate Resultant Is NP-hard in Any Characteristic
- Bruno Grenet, P. Koiran, Natacha Portier
- Mathematics, Computer ScienceInternational Symposium on Mathematical…
- 14 December 2009
The main result is that testing the resultant for zero is NP-hard under deterministic reductions in any characteristic, for systems of low-degree polynomials with coefficients in the ground field (rather than in an extension).
AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM
- Bruno Grenet
- Mathematics
- 2012
The Permanent versus Determinant problem is the following: Given an n × n matrix X of indeterminates over a field of characteristic different from two, find the smallest matrix M whose coefficients…
Fast in-place algorithms for polynomial operations: division, evaluation, interpolation
- Pascal Giorgi, Bruno Grenet, Daniel S. Roche
- Computer Science, MathematicsInternational Symposium on Symbolic and Algebraic…
- 24 February 2020
New in-place algorithms for the aforementioned polynomial computations which require only constant extra space and achieve the same asymptotic running time as their out-of-place counterparts are demonstrated.
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
- Bruno Grenet, P. Koiran, Natacha Portier, Y. Strozecki
- Mathematics, Computer ScienceFoundations of Software Technology and…
- 7 July 2011
It is shown that the real tau-conjecture holds true for a restricted class of sums of products of sparse polynomials, and lower bounds for arestricted class of depth-4 circuits are shown.
On the complexity of the multivariate resultant
- Bruno Grenet, P. Koiran, Natacha Portier
- Mathematics, Computer ScienceJournal of Complexity
- 4 October 2012
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits
- Bruno Grenet, E. Kaltofen, P. Koiran, Natacha Portier
- MathematicsArXiv
- 21 July 2010
It is shown that the partial permanent cannot be VNP-complete in a finite field of characteristic 2 unless the polynomial hierarchy collapses, and algebraic complexity theoretic techniques for constructing symmetric determinantal representations of formulas and weakly skew circuits are deployed.
Deterministic root finding over finite fields using Graeffe transforms
- Bruno Grenet, J. Hoeven, Grégoire Lecerf
- Computer Science, MathematicsApplicable Algebra in Engineering, Communication…
- 1 June 2016
New deterministic algorithms, based on Graeffe transforms, to compute all the roots of a polynomial which splits over a finite field, and a new nearly optimal algorithm for computing characteristic polynomials of multiplication endomorphisms in finite field extensions.
Bounded-degree factors of lacunary multivariate polynomials
- Bruno Grenet
- Mathematics, Computer ScienceJournal of symbolic computation
- 11 December 2014
Factoring bivariate lacunary polynomials without heights
- A. Chattopadhyay, Bruno Grenet, P. Koiran, Natacha Portier, Y. Strozecki
- Computer Science, MathematicsInternational Symposium on Symbolic and Algebraic…
- 19 June 2012
The algorithm obtained is more elementary than the one by Kaltofen and Koiran (ISSAC'05) since it relies on the valuation of polynomials of the previous form instead of the height of the coefficients, and can be used to find some linear factors of bivariate lacunary polynomsials over a field of large finite characteristic in probabilistic polynomial time.
...
...