( en | de | ru )

 

Disambiguation of "Pardo, Luis Miguel"

Author of the publication

copydeleteadd this publication to your clipboard
On Bezout Inequalities for non-homogeneous Polynomial Ideals.

, , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luis Pardo

Luis Miguel Rodrigues Saraiva

Luis Miguel Guachalla Gutierrez

Luis Miguel Ferrer Caubet

Luis Miguel Carrujo Covas

 

Other publications of authors with the same name

Systems of rational polynomial equations have polynomial size approximate zeros on the average., , and . J. Complex., 19 (2): 161-209 (2003)Effective methods in algebraic geometry., , and . J. Symb. Comput., 44 (9): 1087-1088 (2009)Rabin's width of a complete proof and the width of a semialgebraic set., and . EUROCAL, volume 378 of Lecture Notes in Computer Science, page 456-462. Springer, (1987)How Lower and Upper Complexity Bounds Meet in Elimination Theory.. AAECC, volume 948 of Lecture Notes in Computer Science, page 33-69. Springer, (1995)Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces., , , , and . Found. Comput. Math., 12 (1): 75-122 (2012)The Hardness of Polynomial Equation Solving., , , , and . Found. Comput. Math., 3 (4): 347-420 (2003)The Distribution of Condition Numbers of Rational Data of Bounded Bit Length., , , and . Found. Comput. Math., 2 (1): 1-52 (2002)Estimates on the Distribution of the Condition Number of Singular Matrices., and . Found. Comput. Math., 7 (1): 87-134 (2007)A Note on Rabin's Width of a Complete Proof., , and . Comput. Complex., (1994)Lower bounds for arithmetic networks II: Sum of Betti numbers., , and . Appl. Algebra Eng. Commun. Comput., 7 (1): 41-51 (1995)