Image de couverture de livre

Hilbert's Nullstellensatz is in the Counting Hierarchy

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Andrews, Robert, Garg, Abhibhav, Schost, Éric
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Symbolic Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
par: Garg, Abhibhav, et autres
Publié: (2025)

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
par: Andrews, Robert, et autres
Publié: (2024)

Modular composition & polynomial GCD in the border of small, shallow circuits
par: Andrews, Robert, et autres
Publié: (2025)

An Improved Construction of Variety-Evasive Subspace Families
par: Andrews, Robert, et autres
Publié: (2026)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
par: Khichane, Sara, et autres
Publié: (2026)

Fast interpolation and multiplication of unbalanced polynomials
par: Giorgi, Pascal, et autres
Publié: (2024)

Fast polynomial computations with space constraints
par: Grenet, Bruno
Publié: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
par: Dwivedi, Ashish, et autres
Publié: (2024)

Faster modular composition using two relation matrices
par: Neiger, Vincent, et autres
Publié: (2026)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
par: Bournez, Olivier, et autres
Publié: (2026)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
par: Vu, Thi Xuan
Publié: (2025)

A New Bound on Cofactors of Sparse Polynomials
par: Nahshon, Ido, et autres
Publié: (2023)

On the complexity of Chow and Hurwitz forms
par: Doğan, Mahmut Levent, et autres
Publié: (2022)

A quasi-optimal lower bound for skew polynomial multiplication
par: Chen, Qiyuan, et autres
Publié: (2024)

Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set
par: Elliott, Jesse, et autres
Publié: (2025)

Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
par: Prébet, Rémi, et autres
Publié: (2024)

A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case
par: Hackl, Benjamin, et autres
Publié: (2025)

Quantifier Elimination Meets Treewidth
par: Wu, Hao, et autres
Publié: (2026)

Identity Testing for Radical Expressions
par: Balaji, Nikhil, et autres
Publié: (2022)

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

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
par: Ledaguenel, Arthur, et autres
Publié: (2024)

Trinomials and Deterministic Complexity Limits for Real Solving
par: Boniface, Emma, et autres
Publié: (2022)

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems
par: Paouris, Grigoris, et autres
Publié: (2019)

The Scaling Properties of Implicit Deductive Reasoning in Transformers
par: Vompa, Enrico, et autres
Publié: (2026)

Extrapolating Solution Paths of Polynomial Homotopies towards Singularities with PHCpack and phcpy
par: Verschelde, Jan, et autres
Publié: (2024)

A parametric version of the Hilbert Nullstellensatz
par: Manssour, Rida Ait El, et autres
Publié: (2024)

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

On Exact Reznick, Hilbert-Artin and Putinar's Representations
par: Magron, Victor, et autres
Publié: (2018)

The Recovery of $λ$ from a Hilbert Polynomial
par: Donato, Joseph, et autres
Publié: (2024)

Rank Bounds and PIT for $Σ^3 ΠΣΠ^d$ circuits via a non-linear Edelstein-Kelly theorem
par: Garg, Abhibhav, et autres
Publié: (2025)

Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
par: Huang, Wei-Jia, et autres
Publié: (2026)

Integer multiplication is at least as hard as matrix transposition
par: Harvey, David, et autres
Publié: (2025)

Computation of the Hilbert Series for the Support-Minors Modeling of the MinRank Problem
par: Bardet, Magali, et autres
Publié: (2025)

On the gradient of the coefficient of the characteristic polynomial
par: Ikenmeyer, Christian
Publié: (2025)

Recent Advances in Debordering Methods
par: Dutta, Pranjal, et autres
Publié: (2025)

Verified Language Processing with Hybrid Explainability: A Technical Report
par: Fox, Oliver Robert, et autres
Publié: (2025)

An exposition of recent list-size bounds of FRS Codes
par: Garg, Abhibhav, et autres
Publié: (2025)

A Note on Ambiguity in W.B. Yeats’ “Sailing to Byzantium”
par: Sandhya Tripathi
Publié: (2020)

Solving parametric polynomial systems using Generic Rational Univariate Representation
par: Corniquel, Florent
Publié: (2026)