scientific article; zbMATH DE number 3759547

Cited in

(47)

On interpolating arithmetic read-once formulas with exponentiation
Elimination of parameters in the polynomial hierarchy
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
Polar varieties, real equation solving, and data structures: the hypersurface case
Elimination of constants from machines over algebraically closed fields
Complexity bounds in elimination theory -- a survey.
The Projective Noether Maple Package: Computing the dimension of a projective variety
Effective equidimensional decomposition of affine varieties
Sparse resultants and straight-line programs
Functional programming concepts and straight-line programs in computer algebra
The number of reducible space curves over a finite field
Time-space tradeoffs in algebraic complexity theory
A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
Bit complexity for computing one point in each connected component of a smooth real algebraic set
Degeneracy loci and polynomial equation solving
Mining circuit lower bound proofs for meta-algorithms
Unifying known lower bounds via geometric complexity theory
Generalized polar varieties: geometry and algorithms
Lower complexity bounds for interpolation algorithms
Computing multihomogeneous resultants using straight-line programs
Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
Improved explicit estimates on the number of solutions of equations over a finite field
On the complexity of the resolvent representation of some prime differential ideals
Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
Computing generators of the ideal of a smooth affine algebraic variety
On sets of linear forms of maximal complexity
Weak identifiability for differential algebraic systems
Arithmetic circuits: a chasm at depth 3
Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
Variant quantifier elimination
A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set
Lower bounds against weakly-uniform threshold circuits
Derandomization from Algebraic Hardness
Generalized polar varieties and an efficient real elimination.
Kronecker's and Newton's approaches to solving: a first comparison
Computing bases of complete intersection rings in Noether position
Deformation techniques to solve generalised Pham systems
Sparse polynomial interpolation: faster strategies over finite fields
A Kronecker algorithm for locally closed sets over a perfect field
Towards a library for straight-line programs
Erzeugungsgrad, VC-dimension and neural networks with rational activation function
Definability and fast quantifier elimination in algebraically closed fields
New effective differential Nullstellensatz
An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
On sign conditions over real multivariate polynomials
A parametric representation of totally mixed Nash equilibria

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 Q3942397)