default search action
Gregorio Malajovich
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]Gregorio Malajovich:
On the expected number of real roots of polynomials and exponential sums. J. Complex. 76: 101720 (2023) - 2020
- [i8]Gregorio Malajovich:
Complexity of Sparse Polynomial Solving 2: Renormalization. CoRR abs/2005.01223 (2020)
2010 – 2019
- 2019
- [j22]Gregorio Malajovich:
Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric. Found. Comput. Math. 19(1): 1-53 (2019) - [j21]Gregorio Malajovich, Mike Shub:
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations. J. ACM 66(4): 27:1-27:38 (2019) - 2018
- [i7]Gregorio Malajovich, Mike Shub:
A theory of NP-completeness and ill-conditioning for approximate real computations. CoRR abs/1803.03600 (2018) - 2017
- [j20]Gregorio Malajovich:
Computing Mixed Volume and All Mixed Cells in Quermassintegral Time. Found. Comput. Math. 17(5): 1293-1334 (2017) - 2013
- [j19]Gregorio Malajovich:
On the Expected Number of Zeros of Nonlinear Equations. Found. Comput. Math. 13(6): 867-884 (2013) - 2012
- [j18]Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A numerical algorithm for zero counting. III: Randomization and condition. Adv. Appl. Math. 48(1): 215-248 (2012) - [j17]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number II. SIAM J. Matrix Anal. Appl. 33(3): 905-939 (2012) - 2011
- [i6]Jean-Pierre Dedieu, Gregorio Malajovich, Michael Shub:
Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations. CoRR abs/1104.2084 (2011) - 2010
- [i5]Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A Numerical Algorithm for Zero Counting. III: Randomization and Condition. CoRR abs/1007.1597 (2010)
2000 – 2009
- 2009
- [j16]Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
Convexity Properties of the Condition Number. SIAM J. Matrix Anal. Appl. 31(3): 1491-1506 (2009) - [i4]Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis. CoRR abs/0909.4101 (2009) - 2008
- [j15]Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich:
Guest Editor's Preface. J. Complex. 24(1): 2 (2008) - [j14]Jean-Pierre Dedieu, Gregorio Malajovich:
On the number of minima of a random polynomial. J. Complex. 24(2): 89-108 (2008) - [j13]Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A numerical algorithm for zero counting, I: Complexity and accuracy. J. Complex. 24(5-6): 582-605 (2008) - 2007
- [j12]Gregorio Malajovich, Klaus Meer:
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40(4): 553-570 (2007) - [i3]Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor:
A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy. CoRR abs/0710.4508 (2007) - 2005
- [j11]Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub:
On the Curvature of the Central Path of Linear Programming Theory. Found. Comput. Math. 5(2): 145-171 (2005) - [j10]Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub:
Guest editors' preface. J. Complex. 21(1): 4- (2005) - [c1]Gregorio Malajovich, Klaus Meer:
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard. STACS 2005: 244-255 - 2004
- [j9]Gregorio Malajovich, J. Maurice Rojas:
High probability analysis of the condition number of sparse polynomial systems. Theor. Comput. Sci. 315(2-3): 525-555 (2004) - [i2]Klaus Meer, Gregorio Malajovich:
On the Complexity of Computing Multi-Homogeneous Bézout Numbers. Algorithms and Complexity for Continuous Problems 2004 - [i1]Gregorio Malajovich, Klaus Meer:
Computing Multi-Homogeneous Bezout Numbers is Hard. CoRR cs.CC/0405021 (2004) - 2002
- [j8]Gregorio Malajovich:
Lower bounds for some decision problems over C. Theor. Comput. Sci. 276(1-2): 425-434 (2002) - 2001
- [j7]James Demmel, Benjamin Diament, Gregorio Malajovich:
On the Complexity of Computing Error Bounds. Found. Comput. Math. 1(1): 101-125 (2001) - [j6]Gregorio Malajovich:
On a Transfer Theorem for the P != NP Conjecture. J. Complex. 17(1): 27-85 (2001) - [j5]Gregorio Malajovich, Jorge P. Zubelli:
On the Geometry of Graeffe Iteration. J. Complex. 17(3): 541-573 (2001) - [j4]Gregorio Malajovich, Jorge P. Zubelli:
Tangent Graeffe iteration. Numerische Mathematik 89(4): 749-782 (2001) - 2000
- [j3]Gregorio Malajovich:
Condition Number Bounds for Problems with Integer Coefficients. J. Complex. 16(3): 529-551 (2000)
1990 – 1999
- 1998
- [j2]Gregorio Malajovich, Klaus Meer:
On the Structure of NP_C. SIAM J. Comput. 28(1): 27-35 (1998) - 1994
- [j1]Gregorio Malajovich:
On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis. Theor. Comput. Sci. 133(1): 65-84 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint