On the intrinsic complexity of the arithmetic Nullstellensatz (original) (raw)
Related papers
On the reduction in multiplicative complexity achieved by the polynomial residue number system
IEEE Transactions on Signal Processing, 1992
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
Computational Complexity, 1996
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets
ACM SIGSAM Bulletin, 1999
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Theoretical Computer Science, 2002
A Survey on the Complexity of Solving Algebraic Systems
International Mathematical Forum, 2010
On the Complexity of Some Arithmetic Problems over F2[T]
Joachim von Zur Gathen, Anna Bernasconi
The Hardness of Polynomial Equation Solving
Foundations of Computational Mathematics, 2003
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
2008
Some Complexity Results for Polynomial Ideals
Journal of Complexity, 1997
Computing infeasibility certificates for combinatorial problems through Hilbert’s Nullstellensatz
Journal of Symbolic Computation, 2011
On the Number of Additions to Compute Specific Polynomials
SIAM Journal on Computing, 1976
Sharp Estimates for the Arithmetic Nullstellensatz
Duke Mathematical Journal, 2001
Abstracts of the eighth Spanish meeting on computer algebra and applications
Philippe Gimenez, Isabel Bermejo
ACM SIGSAM Bulletin, 2003
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
Combinatorics, Probability and Computing, 2009
1997
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014
On computing greatest common divisors with polynomials given by black boxes for their evaluations
1995
Succinct certificates for the solvability of binary quadratic Diophantine equations
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
On finding small solutions of modular multivariate polynomial equations
Lecture Notes in Computer Science, 1998
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
preprint, 2023
Abstracts from the 20th Conference on Applications of Computer Algebra, ACA 2014
2014
Signature functions for algebraic numbers
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
On the intrinsic complexity of elimination problems in effective algebraic geometry
Contemporary Mathematics, 2013
Arithmetic Circuits and Polynomial Replacement Systems
SIAM Journal on Computing, 2004
Some decision problems for polynomial mappings
Theoretical Computer Science, 1978
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
Corr, 2003
The Hilbert’s-Tenth-Problem Operator
Israel Journal of Mathematics, 2019
“Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Lecture Notes in Computer Science
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
Journal of Computer and System Sciences, 2001
Data Structures and Polynomial Equation Solving
Probabilistic Zero Test for Elimination Polynomials 1
Integer Complexity Generalizations in Various Rings
Cornell University - arXiv, 2022
Computational complexity of some problems involving congruences on algebras
Theoretical Computer Science, 2002