J. Maurice Rojas

From MaRDI portal
Person:202083

Available identifiers

zbMath Open rojas.j-mauriceMaRDI QIDQ202083

List of research outcomes





PublicationDate of PublicationType
A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields2025-01-20Paper
Quickly computing isotopy type for exponential sums over circuits (extended abstract)2024-05-13Paper
Counting roots for polynomials modulo prime powers2023-08-02Paper
Computing zeta functions of large polynomial systems over finite fields2022-09-12Paper
A complexity chasm for solving sparse polynomial equations over p -adic fields2022-09-06Paper
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields2022-08-25Paper
Sturm's Theorem with Endpoints2022-08-16Paper
Trinomials and Deterministic Complexity Limits for Real Solving2022-02-12Paper
Correction to: ``Tropical varieties for exponential sums2021-08-27Paper
Smoothed analysis for the condition number of structured real polynomial systems2021-07-07Paper
Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings2021-02-02Paper
Counting Real Roots in Polynomial-Time for Systems Supported on Circuits2020-12-09Paper
A Faster Solution to Smale's 17th Problem I2020-09-10Paper
Tropical varieties for exponential sums2020-08-06Paper
Book Review: Kolmogorov complexity and algorithmic randomness2020-03-20Paper
A complexity chasm for solving univariate sparse polynomial equations over $p$-adic fields2020-02-29Paper
Randomized polynomial-time root counting in prime power rings2019-10-07Paper
Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions2019-02-21Paper
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces2018-04-18Paper
Dedekind Zeta Zeroes and Faster Complex Dimension Computation2018-03-11Paper
New Subexponential Fewnomial Hypersurface Bounds2017-10-02Paper
Sparse univariate polynomials with many roots over finite fields2017-07-13Paper
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields2017-02-10Paper
Optimization and NP_R-completeness of certain fewnomials2017-02-03Paper
A-Discriminants for Complex Exponents, and Counting Real Isotopy Types2016-12-11Paper
On the complexity of Diophantine geometry in low dimensions (extended abstract)2016-09-29Paper
Sublinear root detection and new hardness results for sparse polynomials over finite fields2016-08-26Paper
Fewnomial systems with many roots, and an Adelic Tau Conjecture2015-09-07Paper
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving2015-04-17Paper
Book review of: Inevitable randomness in discrete mathematics, by József Beck2013-09-16Paper
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent2013-09-02Paper
https://portal.mardi4nfdi.de/entity/Q49147632013-04-15Paper
New Multiplier Sequences via Discriminant Amoebae2013-01-17Paper
Faster real feasibility via circuit discriminants2012-05-13Paper
Faster \(p\)-adic feasibility for certain multivariate sparse polynomials2012-05-04Paper
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond2012-01-05Paper
Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)2011-03-29Paper
Refined Asymptotics for Multigraded Sums of Squares2009-01-23Paper
https://portal.mardi4nfdi.de/entity/Q54475482008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54483472008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54472812008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54473512008-03-06Paper
Algorithmic Arithmetic Fewnomial Theory I: One Variable2007-11-16Paper
On solving univariate sparse polynomials in logarithmic time2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q47375112004-08-11Paper
High probability analysis of the condition number of sparse polynomial systems2004-08-06Paper
Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces2004-07-07Paper
Arithmetic multivariate Descartes' rule2004-03-16Paper
https://portal.mardi4nfdi.de/entity/Q44536672004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q47891992003-04-23Paper
Some speed-ups and speed limits for real algebraic geometry2003-04-06Paper
Dedekind Zeta Functions and the Complexity of Hilbert's Nullstellensatz2003-01-11Paper
Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy2002-07-15Paper
An Improved Bound on the VC-Dimension of Neural Networks with Polynomial Activation Functions2001-12-19Paper
Algebraic geometry over four rings and the frontier to tractability.2001-07-26Paper
On Solving Fewnomials Over Intervals in Fewnomial Time2001-06-26Paper
https://portal.mardi4nfdi.de/entity/Q43293982001-01-01Paper
Random Sparse Polynomial Systems2000-12-13Paper
Solving degenerate sparse polynomial systems faster2000-08-21Paper
Counting Isolated Roots of Trinomial Systems in the Plane and Beyond2000-08-09Paper
Uncomputably large integral points on algebraic plane curves?2000-06-04Paper
Computing Complex Dimension Faster and Deterministically2000-05-03Paper
https://portal.mardi4nfdi.de/entity/Q42520292000-01-11Paper
https://portal.mardi4nfdi.de/entity/Q42373761999-09-09Paper
Counting affine roots of polynomial systems via pointed Newton polytopes1998-04-07Paper
https://portal.mardi4nfdi.de/entity/Q43361161997-06-12Paper
https://portal.mardi4nfdi.de/entity/Q47179611997-01-07Paper
A convex geometric approach to counting the roots of a polynomial system1995-05-14Paper
Extensions and Corrections for: ``A Convex Geometric Approach to Counting the Roots of a Polynomial SystemN/APaper
Some New Applications of Toric GeometryN/APaper
Toric Generalized Characteristic PolynomialsN/APaper
Viro's patchworking and the signed reduced A-discriminantN/APaper

Research outcomes over time

This page was built for person: J. Maurice Rojas