Counting roots for polynomials modulo prime powers (Q6165864): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128417346, #quickstatements; #temporary_batch_1729472024320
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099599705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster \(p\)-adic feasibility for certain multivariate sparse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial root finding over local rings and application to error correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing zeta functions of nondegenerate curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3548596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse univariate polynomials with many roots over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the deterministic complexity of factoring polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new incremental algorithm for computing Groebner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new framework for computing Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-adic numbers: An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic root finding over finite fields using Graeffe transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-factor lifting and factorization of polynomials over local fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex powers and asymptotic expansions. I. Functions of certain types. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial Factorization and Modular Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting solutions to equations in many variables over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the Brauer–Manin Obstruction for Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring modular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434206 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128417346 / rank
 
Normal rank

Latest revision as of 02:11, 21 October 2024

scientific article; zbMATH DE number 7721125
Language Label Description Also known as
English
Counting roots for polynomials modulo prime powers
scientific article; zbMATH DE number 7721125

    Statements

    Counting roots for polynomials modulo prime powers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2023
    0 references
    polynomials
    0 references
    root counting
    0 references
    prime power
    0 references

    Identifiers

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