Kronecker's and Newton's approaches to solving: a first comparison (Q5938585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Primality testing and Abelian varieties over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5825281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curves and Primality Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the geometry of numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for overdetermined systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition Number Analysis for Sparse Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimations for the separation number of a polynomial system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some lower bounds for the complexity of continuation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of linear equations using p-adic expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850731 / 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: Q4352797 / 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: On the intrinsic complexity of the arithmetic Nullstellensatz / 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: Q3835021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological complexity of a root finding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4297380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton polytopes and the Bezout theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials over Algebraic Number Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability by radicals is in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Newton algorithms: Quadratic convergence, path-following and error analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks. II: Sum of Betti numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur des hauteurs alternatives. I. (On alternative heights. I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur des hauteurs alternatives. II (On alternative heights. II) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternative heights. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3310704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity. On the geometry of polynomials and a theory of cost. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II / 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 IV: Probability of Success; Extensions / 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: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of algorithms of analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4861423 / 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: Q4852341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal constant for the convergence of Newton's method and an application to the classical homotopy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4760119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 17:37, 3 June 2024

scientific article; zbMATH DE number 1623069
Language Label Description Also known as
English
Kronecker's and Newton's approaches to solving: a first comparison
scientific article; zbMATH DE number 1623069

    Statements

    Kronecker's and Newton's approaches to solving: a first comparison (English)
    0 references
    11 August 2002
    0 references
    Kronecker's solution
    0 references
    Newton operator
    0 references
    approximate zero
    0 references
    straight-line programs
    0 references
    height of diophantine varieties
    0 references
    degree of algebraic varieties
    0 references
    Turing machine complexity
    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
    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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references