Deformation techniques for efficient polynomial equation solving. (Q1977143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3806684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jacobian conjecture: Reduction of degree and formal expansion of the inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polar varieties, real equation solving, and data structures: the hypersurface case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a set of points meeting every cell defined by a family of polynomials on a variety / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised characteristic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line programs in geometric elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le rôle des structures de données dans les problèmes d'élimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and fast quantifier elimination in algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of the arithmetic Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic local structure of the morphisms in commutative algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4394966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the theory of analytic spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the affine Bezout inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4306894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of traces in complete intersections and degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies for solving polynomial systems within a bounded domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on results on Bezout's theorem. Notes by D. P. Patil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4760119 / rank
 
Normal rank

Revision as of 14:59, 29 May 2024

scientific article
Language Label Description Also known as
English
Deformation techniques for efficient polynomial equation solving.
scientific article

    Statements

    Deformation techniques for efficient polynomial equation solving. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2000
    0 references
    polynomial equation system
    0 references
    arithmetic circuit
    0 references
    shape (or primitive element) lemma
    0 references
    Newton-Hensel iteration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers