scientific article; zbMATH DE number 939812
From MaRDI portal
Publication:4714022
complete intersectiondiophantine approximationeffective Nullstellensatzmembership problemstraight-line programs
Diophantine approximation, transcendental number theory (11J99) Number-theoretic algorithms; complexity (11Y16) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Relevant commutative algebra (14A05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Recommendations
- On the intrinsic complexity of the arithmetic Nullstellensatz
- scientific article; zbMATH DE number 5497651
- Le rôle des structures de données dans les problèmes d'élimination
- scientific article; zbMATH DE number 5049913
- On the efficiency of effective Nullstellensätze
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- scientific article; zbMATH DE number 806915
- Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree
- scientific article; zbMATH DE number 939820
- On the complexity of CSP-based ideal membership problems
Cited in
(48)- Evaluation techniques for zero-dimensional primary decomposition
- A sparse effective Nullstellensatz
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- A direct method for simulating partial recursive functions by Diophantine equations
- Lower bounds for diophantine approximations
- Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
- Straight-line programs in geometric elimination theory
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
- Algorithms for residues and Łojasiewicz exponents
- Condition number bounds for problems with integer coefficients
- Effective equidimensional decomposition of affine varieties
- Matrices in elimination theory
- Functional programming concepts and straight-line programs in computer algebra
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Complexity results for triangular sets
- Time-space tradeoffs in algebraic complexity theory
- Deformation techniques for efficient polynomial equation solving.
- Cook's versus Valiant's hypothesis
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- Complexity of solving parametric polynomial systems
- Leibniz complexity of Nash functions on differentiations
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Generalized polar varieties: geometry and algorithms
- A concise proof of the Kronecker polynomial system solver from scratch
- Bezoutian and quotient ring structure
- On the complexity of the resolvent representation of some prime differential ideals
- Weak identifiability for differential algebraic systems
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Fast computation of a rational point of a variety over a finite field
- scientific article; zbMATH DE number 4154522 (Why is no real title available?)
- scientific article; zbMATH DE number 599115 (Why is no real title available?)
- Generalized polar varieties and an efficient real elimination.
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture
- A Gröbner free alternative for polynomial system solving
- Kronecker's and Newton's approaches to solving: a first comparison
- A new method to obtain lower bounds for polynomial evaluation
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
- Computing bases of complete intersection rings in Noether position
- Polynomial equation solving by lifting procedures for ramified fibers
- Deformation techniques to solve generalised Pham systems
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Evaluating geometric queries using few arithmetic operations
- A Kronecker algorithm for locally closed sets over a perfect field
- Erzeugungsgrad, VC-dimension and neural networks with rational activation function
- Computing polynomial representation in subrings of multivariate polynomial rings
- Rational formulas for traces in zero-dimensional algebras
- Effective approximation of the solutions of algebraic equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714022)
