Deformation techniques to solve generalised Pham systems (Q598226): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q216359
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2004.01.009 / rank
Normal rank
 
Property / author
 
Property / author: Jorge Alonso San Martín / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Kronecker / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030515241 / 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: Q4124950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of polynomial equation solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kronecker's and Newton's approaches to solving: a first comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Multidimensional Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Galois Groups and Hilbert's Irreducibility Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657778 / 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: 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 efficiency of effective Nullstellensätze / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515607 / 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: Q4143433 / 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: Deformation techniques for efficient polynomial equation solving. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intrinsic complexity of parametric elimination methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-space complexity of geometric elimination procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization / 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: Q4714022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp estimates for the arithmetic Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomials, duality, and structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured matrices and Newton's iteration: unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some speed-ups and speed limits for real algebraic geometry / 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: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302492 / 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: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / 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: Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4781203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toric Newton method for polynomial homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems / 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: Q5732721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274348 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2004.01.009 / rank
 
Normal rank

Latest revision as of 21:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Deformation techniques to solve generalised Pham systems
scientific article

    Statements

    Deformation techniques to solve generalised Pham systems (English)
    0 references
    6 August 2004
    0 references
    Generalised Pham system
    0 references
    Universal algorithms
    0 references
    Homotopic deformation
    0 references
    Geometric degree
    0 references
    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

    Identifiers