Copertina

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Garg, Abhibhav, Oliveira, Rafael, Saxena, Nitin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Complexity Symbolic Computation
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Hilbert's Nullstellensatz is in the Counting Hierarchy
di: Andrews, Robert, et al.
Pubblicazione: (2026)

Modular composition & polynomial GCD in the border of small, shallow circuits
di: Andrews, Robert, et al.
Pubblicazione: (2025)

Fast polynomial computations with space constraints
di: Grenet, Bruno
Pubblicazione: (2025)

Fast interpolation and multiplication of unbalanced polynomials
di: Giorgi, Pascal, et al.
Pubblicazione: (2024)

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
di: Andrews, Robert, et al.
Pubblicazione: (2024)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
di: Khichane, Sara, et al.
Pubblicazione: (2026)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
di: Dwivedi, Ashish, et al.
Pubblicazione: (2024)

Identity Testing for Radical Expressions
di: Balaji, Nikhil, et al.
Pubblicazione: (2022)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
di: Bournez, Olivier, et al.
Pubblicazione: (2026)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
di: Vu, Thi Xuan
Pubblicazione: (2025)

A New Bound on Cofactors of Sparse Polynomials
di: Nahshon, Ido, et al.
Pubblicazione: (2023)

On the complexity of Chow and Hurwitz forms
di: Doğan, Mahmut Levent, et al.
Pubblicazione: (2022)

A quasi-optimal lower bound for skew polynomial multiplication
di: Chen, Qiyuan, et al.
Pubblicazione: (2024)

Rank Bounds and PIT for $Σ^3 ΠΣΠ^d$ circuits via a non-linear Edelstein-Kelly theorem
di: Garg, Abhibhav, et al.
Pubblicazione: (2025)

Quantifier Elimination Meets Treewidth
di: Wu, Hao, et al.
Pubblicazione: (2026)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
di: Fruehwirth, Thom
Pubblicazione: (2023)

An Improved Construction of Variety-Evasive Subspace Families
di: Andrews, Robert, et al.
Pubblicazione: (2026)

Two Algorithms for Computing Rational Univariate Representations of Zero-Dimensional Ideals with Parameters
di: Wang, Dingkang, et al.
Pubblicazione: (2024)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
di: Ledaguenel, Arthur, et al.
Pubblicazione: (2024)

Trinomials and Deterministic Complexity Limits for Real Solving
di: Boniface, Emma, et al.
Pubblicazione: (2022)

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems
di: Paouris, Grigoris, et al.
Pubblicazione: (2019)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
di: Yamakami, Tomoyuki
Pubblicazione: (2024)

The Scaling Properties of Implicit Deductive Reasoning in Transformers
di: Vompa, Enrico, et al.
Pubblicazione: (2026)

Primality Testing via Circulant Matrix Eigenvalue Structure: A Novel Approach Using Cyclotomic Field Theory
di: Dinu, Marius-Constantin
Pubblicazione: (2025)

Extrapolating Solution Paths of Polynomial Homotopies towards Singularities with PHCpack and phcpy
di: Verschelde, Jan, et al.
Pubblicazione: (2024)

On the Problem of Separating Variables in Multivariate Polynomial Ideals
di: Buchacher, Manfred, et al.
Pubblicazione: (2024)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
di: Sule, Virendra
Pubblicazione: (2023)

Computing Generic Fibers of Polynomial Ideals with FGLM and Hensel Lifting
di: Berthomieu, Jérémy, et al.
Pubblicazione: (2024)

Recycling Algebraic Proof Certificates
di: Kaufmann, Daniela, et al.
Pubblicazione: (2025)

Positivity Proofs for Linear Recurrences with Several Dominant Eigenvalues
di: Ibrahim, Alaa
Pubblicazione: (2025)

Positivity Proofs for Linear Recurrences through Contracted Cones
di: Ibrahim, Alaa, et al.
Pubblicazione: (2024)

Primary Decomposition of Symmetric Ideals
di: Ishihara, Yuki
Pubblicazione: (2024)

Integer multiplication is at least as hard as matrix transposition
di: Harvey, David, et al.
Pubblicazione: (2025)

A Shape Lemma for Ideals of Differential Operators
di: Kauers, Manuel, et al.
Pubblicazione: (2025)

Comprehensive Systems for Primary Decompositions of Parametric Ideals
di: Ishihara, Yuki, et al.
Pubblicazione: (2024)

A Syzygial Method for Equidimensional Decomposition
di: Mohr, Rafael
Pubblicazione: (2024)

Inferring Equivalence Classes from Legacy Undocumented Embedded Binaries for ISO 26262-Compliant Testing
di: De Luca, Marco, et al.
Pubblicazione: (2026)

On the Computation of Newton Polytopes of Eliminants
di: Mohr, Rafael, et al.
Pubblicazione: (2025)

On Automating Proofs of Multiplier Adder Trees using the RTL Books
di: Manjrekar, Mayank
Pubblicazione: (2025)

Simultaneous Rational Number Codes: Decoding Beyond Half the Minimum Distance with Multiplicities and Bad Primes
di: Abbondati, Matteo, et al.
Pubblicazione: (2025)