default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Maurice Rojas
Person information
- affiliation: Texas A&M University, College Station, TX, USA
- affiliation (former): University of Hong Kong, Hong Kong
- affiliation (PhD 1995): University of California Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]J. Maurice Rojas:
Counting Real Roots in Polynomial-Time via Diophantine Approximation. Found. Comput. Math. 24(2): 639-681 (2024)- [c14]Weixun Deng
, Alperen Ali Ergür, Grigoris Paouris, J. Maurice Rojas:
Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans. ISSAC 2024: 429-436 - 2023
- [j22]Frédéric Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, J. Maurice Rojas:
Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract). ACM Commun. Comput. Algebra 57(3): 152-155 (2023) - 2022
- [j21]Qi Cheng, J. Maurice Rojas, Daqing Wan:
Computing zeta functions of large polynomial systems over finite fields. J. Complex. 73: 101681 (2022) - [i30]Erick Boniface, Weixun Deng, J. Maurice Rojas:
Trinomials and Deterministic Complexity Limits for Real Solving. CoRR abs/2202.06115 (2022) - [i29]Philippe P. Pébay, J. Maurice Rojas, David C. Thompson:
Sturm's Theorem with Endpoints. CoRR abs/2208.07904 (2022) - 2021
- [j20]Alperen Ali Ergür, Grigoris Paouris, J. Maurice Rojas:
Smoothed analysis for the condition number of structured real polynomial systems. Math. Comput. 90(331): 2161-2184 (2021) - [c13]J. Maurice Rojas, Yuyu Zhu:
A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields. ISSAC 2021: 337-344 - [i28]Caleb Robelle, J. Maurice Rojas, Yuyu Zhu:
Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings. CoRR abs/2102.01626 (2021) - [i27]J. Maurice Rojas, Yuyu Zhu:
Root Repulsion and Faster Solving for Very Sparse Polynomials Over p-adic Fields. CoRR abs/2107.09173 (2021) - 2020
- [j19]J. Maurice Rojas, Yuyu Zhu:
A complexity chasm for solving sparse polynomial equations over p-adic fields: extended abstract. ACM Commun. Comput. Algebra 54(3): 86-90 (2020) - [j18]Leann Kopp, Natalie Randall, J. Maurice Rojas, Yuyu Zhu:
Randomized polynomial-time root counting in prime power rings. Math. Comput. 89(321): 373-385 (2020) - [i26]J. Maurice Rojas, Yuyu Zhu:
A complexity chasm for solving sparse polynomial equations over p-adic fields. CoRR abs/2003.00314 (2020) - [i25]Qi Cheng, J. Maurice Rojas, Daqing Wan:
Computing zeta functions of large polynomial systems over finite fields. CoRR abs/2007.13214 (2020) - [i24]J. Maurice Rojas:
Counting Real Roots in Polynomial-Time for Systems Supported on Circuits. CoRR abs/2012.04868 (2020)
2010 – 2019
- 2019
- [j17]Alperen Ali Ergür, Grigoris Paouris, J. Maurice Rojas:
Probabilistic Condition Number Estimates for Real Polynomial Systems I: A Broader Family of Distributions. Found. Comput. Math. 19(1): 131-157 (2019) - [c12]Grigoris Paouris, Kaitlyn Phillipson, J. Maurice Rojas:
A Faster Solution to Smale's 17th Problem I: Real Binomial Systems. ISSAC 2019: 323-330 - [i23]Grigoris Paouris, Kaitlyn Phillipson, J. Maurice Rojas:
A Faster Solution to Smale's 17th Problem I: Real Binomial Systems. CoRR abs/1901.09739 (2019) - 2018
- [j16]Martin E. Avendano, Roman Kogan, Mounir Nisse, J. Maurice Rojas:
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces. J. Complex. 46: 45-65 (2018) - [i22]J. Maurice Rojas, Yuyu Zhu:
Dedekind Zeta Zeroes and Faster Complex Dimension Computation. CoRR abs/1803.04104 (2018) - [i21]Leann Kopp, Natalie Randall, J. Maurice Rojas, Yuyu Zhu:
Randomized Polynomial-Time Root Counting in Prime Power Rings. CoRR abs/1808.10531 (2018) - [i20]Alperen Ali Ergür, Grigoris Paouris, J. Maurice Rojas:
Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis. CoRR abs/1809.03626 (2018) - 2017
- [j15]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Sparse univariate polynomials with many roots over finite fields. Finite Fields Their Appl. 46: 235-246 (2017) - [i19]Jens Forsgård, Mounir Nisse, J. Maurice Rojas:
New Subexponential Fewnomial Hypersurface Bounds. CoRR abs/1710.00481 (2017) - [i18]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Counting Roots of Polynomials Over Prime Power Rings. CoRR abs/1711.01355 (2017) - 2016
- [j14]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. SIAM J. Comput. 45(4): 1433-1447 (2016) - [i17]J. Maurice Rojas, Korben Rusek:
A-Discriminants for Complex Exponents and Counting Real Isotopy Types. CoRR abs/1612.03458 (2016) - 2015
- [p1]Eleanor Anthony, Sheridan Grant, Peter Gritzmann, J. Maurice Rojas:
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces 2015: 255-277 - 2014
- [i16]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Sparse Univariate Polynomials with Many Roots Over Finite Fields. CoRR abs/1411.6346 (2014) - 2013
- [c11]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. ISSAC 2013: 61-68 - [i15]Martin E. Avendano, Roman Kogan, Mounir Nisse, J. Maurice Rojas:
Metric Estimates and Membership Complexity for Archimedean Amoebae and Tropical Hypersurfaces. CoRR abs/1307.3681 (2013) - [i14]Pascal Koiran, Natacha Portier, J. Maurice Rojas:
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. CoRR abs/1309.0486 (2013) - [i13]Eleanor Anthony, Sheridan Grant, Peter Gritzmann, J. Maurice Rojas:
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving. CoRR abs/1312.6547 (2013) - 2012
- [j13]Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Faster p-adic feasibility for certain multivariate sparse polynomials. J. Symb. Comput. 47(4): 454-479 (2012) - [i12]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields. CoRR abs/1204.1113 (2012) - 2011
- [j12]Philippe P. Pébay, J. Maurice Rojas, David C. Thompson:
Optimizing n-variate (n+k)-nomials for small k. Theor. Comput. Sci. 412(16): 1457-1469 (2011) - [i11]Osbert Bastani, Christopher J. Hillar, Dimitar Popov, J. Maurice Rojas:
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond. CoRR abs/1101.2642 (2011) - 2010
- [c10]Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable. ISSAC 2010: 331-338 - [i10]Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Near NP-Completeness for Detecting p-adic Rational Roots in One Variable. CoRR abs/1001.4252 (2010) - [i9]Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials. CoRR abs/1010.5310 (2010) - [i8]Kaitlyn Phillipson, J. Maurice Rojas:
Fewnomial Systems with Many Roots, and an Adelic Tau Conjecture. CoRR abs/1011.4128 (2010)
2000 – 2009
- 2009
- [c9]Frédéric Bihan, J. Maurice Rojas, Casey E. Stella:
Faster real feasibility via circuit discriminants. ISSAC 2009: 39-46 - [c8]Philippe P. Pébay, J. Maurice Rojas, David C. Thompson:
Optimization and NP_R-completeness of certain fewnomials. SNC 2009: 133-142 - [i7]Frédéric Bihan, J. Maurice Rojas, Casey E. Stella:
Faster Real Feasibility via Circuit Discriminants. CoRR abs/0901.4400 (2009) - 2008
- [j11]J. Maurice Rojas:
Book Review S. Basu, R. Pollack, and M.-F. Roy: Algorithms in Real Algebraic Geometry. Found. Comput. Math. 8(6): 765-771 (2008) - 2007
- [i6]Joel Gomez, Andrew Niles, J. Maurice Rojas:
New Complexity Bounds for Certain Real Fewnomial Zero Sets. CoRR abs/0709.2405 (2007) - 2005
- [j10]J. Maurice Rojas, Yinyu Ye:
On solving univariate sparse polynomials in logarithmic time. J. Complex. 21(1): 87-110 (2005) - [j9]Jerod Parsons, J. Bradley Holmes, J. Maurice Rojas, Jerry Tsai, Charlie E. M. Strauss:
Practical conversion from torsion space to Cartesian space for in silico protein synthesis. J. Comput. Chem. 26(10): 1063-1068 (2005) - [i5]J. Maurice Rojas:
Efficiently Detecting Torsion Points and Subtori. CoRR abs/math/0501388 (2005) - 2004
- [j8]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) - [i4]J. Maurice Rojas, Casey E. Stella:
New Complexity Thresholds for Sparse Real Polynomials and A-discriminants. CoRR math.AG/0411107 (2004) - 2003
- [j7]Tien-Yien Li, J. Maurice Rojas, Xiaoshen Wang:
Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces. Discret. Comput. Geom. 30(3): 379-414 (2003) - [c7]John Keyser, Koji Ouchi, J. Maurice Rojas:
The Exact Rational Univariate Representation for Detecting Degeneracies. Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing 2003: 299-328 - [i3]J. Maurice Rojas:
A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture. CoRR math.NT/0304100 (2003) - 2002
- [c6]J. Maurice Rojas:
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields. ANTS 2002: 506-516 - 2001
- [j6]J. Maurice Rojas:
Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy. J. Comput. Syst. Sci. 62(2): 216-235 (2001) - 2000
- [j5]J. Maurice Rojas:
Some Speed-Ups and Speed Limits for Real Algebraic Geometry. J. Complex. 16(3): 552-571 (2000) - [j4]J. Maurice Rojas:
Uncomputably large integral points on algebraic plane curves? Theor. Comput. Sci. 235(1): 145-162 (2000)
1990 – 1999
- 1999
- [j3]J. Maurice Rojas:
Solving Degenerate Sparse Polynomial Systems Faster. J. Symb. Comput. 28(1-2): 155-186 (1999) - [c5]J. Maurice Rojas:
On the Complexity of Diophantine Geometry in Low Dimensions (Abstract). CCC 1999: 3 - [c4]J. Maurice Rojas:
On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract). STOC 1999: 527-536 - 1998
- [c3]J. Maurice Rojas:
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting. ESA 1998: 127-138 - [i2]J. Maurice Rojas:
Solving Degenerate Sparse Polynomial Systems Faster. CoRR math.AG/9809071 (1998) - [i1]J. Maurice Rojas:
Uncomputably Large Integral Points on Algebraic Plane Curves? CoRR math.NT/9809009 (1998) - 1997
- [c2]J. Maurice Rojas:
A new approach to counting Nash equilibria. CIFEr 1997: 130-136 - 1996
- [j2]J. Maurice Rojas, Xiaoshen Wang:
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes. J. Complex. 12(2): 116-133 (1996) - 1994
- [j1]J. Maurice Rojas:
A Convex Geometric Approach to Counting the Roots of a Polynomial System. Theor. Comput. Sci. 133(1): 105-140 (1994) - 1991
- [c1]John F. Canny, J. Maurice Rojas:
An Optimal Condition for Determining the Exact Number of Roots of a Polynomial System. ISSAC 1991: 96-102
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-07-20 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
