Algorithms for modular counting of roots of multivariate polynomials (Q2482732): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00453-007-9097-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1577818129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ACC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability of systems of polynomial congruences modulo a large prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Number of Zeroes of a GF[2] Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing zeta functions of Artin-Schreier curves over finite fields. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Chevalley-Warning and the Ax-Katz Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting points on elliptic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting curves and their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chevalley-Warning Approach To p-Adic Estimates of Character Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217873 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:09, 27 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for modular counting of roots of multivariate polynomials
scientific article

    Statements

    Algorithms for modular counting of roots of multivariate polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2008
    0 references
    Polynomials
    0 references
    Modular counting
    0 references
    Reed-Solomon codes
    0 references

    Identifiers

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