The following pages link to J. Maurice Rojas (Q202083):
Displaying 50 items.
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Tropical varieties for exponential sums (Q785323) (← links)
- A convex geometric approach to counting the roots of a polynomial system (Q1338221) (← links)
- Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces (Q1434250) (← links)
- Some speed-ups and speed limits for real algebraic geometry (Q1594829) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (Q1745633) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Uncomputably large integral points on algebraic plane curves? (Q1978704) (← links)
- Correction to: ``Tropical varieties for exponential sums'' (Q2049974) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- Computing zeta functions of large polynomial systems over finite fields (Q2171948) (← links)
- Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
- Counting affine roots of polynomial systems via pointed Newton polytopes (Q2565193) (← links)
- Algebraic geometry over four rings and the frontier to tractability. (Q2715540) (← links)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
- On the complexity of Diophantine geometry in low dimensions (extended abstract) (Q2819585) (← links)
- Book review of: Inevitable randomness in discrete mathematics, by József Beck (Q2849010) (← links)
- Faster real feasibility via circuit discriminants (Q2883798) (← links)
- Fewnomial systems with many roots, and an Adelic Tau Conjecture (Q2943885) (← links)
- Optimization and NP_R-completeness of certain fewnomials (Q2959026) (← links)
- Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (Q2963217) (← links)
- Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond (Q3105516) (← links)
- (Q4237376) (← links)
- (Q4252029) (← links)
- (Q4329398) (← links)
- (Q4336116) (← links)
- (Q4453667) (← links)
- Arithmetic multivariate Descartes' rule (Q4456256) (← links)
- (Q4717961) (← links)
- (Q4737511) (← links)
- (Q4789199) (← links)
- New Multiplier Sequences via Discriminant Amoebae (Q4902632) (← links)
- (Q4914763) (← links)
- Smoothed analysis for the condition number of structured real polynomial systems (Q4999472) (← links)
- A complexity chasm for solving sparse polynomial equations over <i>p</i> -adic fields (Q5102032) (← links)
- A Faster Solution to Smale's 17th Problem I (Q5121124) (← links)
- Book Review: Kolmogorov complexity and algorithmic randomness (Q5220394) (← links)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
- Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving (Q5245952) (← links)
- (Q5447281) (← links)
- (Q5447351) (← links)
- (Q5447548) (← links)
- (Q5448347) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Counting roots for polynomials modulo prime powers (Q6165864) (← links)
- Counting Real Roots in Polynomial-Time for Systems Supported on Circuits (Q6355633) (← links)
