Bruno Grenet

CoRR, 2024

2023

Polynomial modular product verification and its implications.

[BibT_eX]

[DOI]

J. Symb. Comput., 2023

Fast in-place accumulated bilinear formulae.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

CoRR, 2023

In-place fast polynomial modular remainder.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

CoRR, 2023

2022

Random primes in arithmetic progressions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Sparse Polynomial Interpolation and Division in Soft-linear Time.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Random Primes without Primality Testing.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Computing the multilinear factors of lacunary polynomials without heights.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

J. Symb. Comput., 2021

On Exact Division and Divisibility Testing for Sparse Polynomials.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

One (more) line on the most Ancient Algorithm in History.

[BibT_eX]

[DOI]

Ilya Volkovich

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Fast in-place algorithms for polynomial operations: division, evaluation, interpolation.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Essentially optimal sparse polynomial multiplication.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Generic Reductions for In-place Polynomial Multiplication.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2016

Bounded-degree factors of lacunary multivariate polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Deterministic root finding over finite fields using Graeffe transforms.

[BibT_eX]

[DOI]

Joris van der Hoeven

Grégoire Lecerf

Appl. Algebra Eng. Commun. Comput., 2016

2015

Lacunaryx: computing bounded-degree factors of lacunary polynomials.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms.

[BibT_eX]

[DOI]

Joris van der Hoeven

Grégoire Lecerf

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

On the complexity of the multivariate resultant.

[BibT_eX]

[DOI]

Pascal Koiran

Natacha Portier

J. Complex., 2013

Factoring bivariate lacunary polynomials without heights.

[BibT_eX]

[DOI]

Arkadev Chattopadhyay

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Représentations des polynômes, algorithmes et bornes inférieures. (Representations of polynomials, algorithms and lower bounds).

[BibT_eX]

[DOI]

PhD thesis, 2012

Symmetric Determinantal Representations in Characteristic 2

[BibT_eX]

[DOI]

Thierry Monteil

Stéphan Thomassé

CoRR, 2012

2011

Symmetric Determinantal Representation of Weakly-Skew Circuits.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits

[BibT_eX]

[DOI]

CoRR, 2010

Acceptable Complexity Measures of Theorems.

[BibT_eX]

[DOI]

Complex Syst., 2010

The Multivariate Resultant Is NP-hard in Any Characteristic.

[BibT_eX]

[DOI]

Pascal Koiran

Natacha Portier

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

The multivariate resultant lies between NP and AM

[BibT_eX]

[DOI]