Fast multivariate multi-point evaluation revisited (Q2283121): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q192036
Created claim: Wikidata QID (P12): Q128004135, #quickstatements; #temporary_batch_1724813321913
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Grégoire Lecerf / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Kronecker / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2019.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2941649468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster sparse multivariate polynomial interpolation of straight-line programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composing power series over a finite ring in essentially linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial evaluation and interpolation on special sets of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic integer factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer multiplication using plain vanilla FFT primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer multiplication using short lattice vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Polynomial Multiplication over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, but don't be too lazy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated fourier transform and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit-complexity of sparse polynomial and series multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition Modulo Powers of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular composition via factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-point evaluation in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast rectangular matrix multiplication and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for reversion of power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial Factorization and Modular Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the Lickteig-Roy subresultant algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient \(p\)th root computations in finite fields of characteristic \(p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast numerical algorithm for the composition of power series with complex coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4306894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for Primitive Roots in Finite Fields / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128004135 / rank
 
Normal rank

Latest revision as of 09:50, 28 August 2024

scientific article
Language Label Description Also known as
English
Fast multivariate multi-point evaluation revisited
scientific article

    Statements

    Fast multivariate multi-point evaluation revisited (English)
    0 references
    0 references
    0 references
    30 December 2019
    0 references
    multi-point evaluation
    0 references
    modular composition
    0 references
    algorithm
    0 references
    complexity bound
    0 references
    Kedlaya-Umans algorithm
    0 references
    power projection
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references