J. Maurice Rojas

Found. Comput. Math., April, 2024

Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans.

[BibT_eX]

[DOI]

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023

Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract).

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, September, 2023

2022

Computing zeta functions of large polynomial systems over finite fields.

[BibT_eX]

[DOI]

Qi Cheng

Daqing Wan

J. Complex., 2022

Sturm's Theorem with Endpoints.

[BibT_eX]

[DOI]

Philippe P. Pébay

David C. Thompson

CoRR, 2022

Trinomials and Deterministic Complexity Limits for Real Solving.

[BibT_eX]

[DOI]

Erick Boniface

Weixun Deng

CoRR, 2022

2021

Smoothed analysis for the condition number of structured real polynomial systems.

[BibT_eX]

[DOI]

Alperen Ali Ergür

Math. Comput., 2021

Root Repulsion and Faster Solving for Very Sparse Polynomials Over p-adic Fields.

[BibT_eX]

[DOI]

CoRR, 2021

Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings.

[BibT_eX]

[DOI]

Caleb Robelle

CoRR, 2021

A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Randomized polynomial-time root counting in prime power rings.

[BibT_eX]

[DOI]

Math. Comput., 2020

Counting Real Roots in Polynomial-Time for Systems Supported on Circuits.

[BibT_eX]

[DOI]

CoRR, 2020

A complexity chasm for solving sparse polynomial equations over p-adic fields.

[BibT_eX]

[DOI]

CoRR, 2020

A complexity chasm for solving sparse polynomial equations over p-adic fields: extended abstract.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2020

2019

Probabilistic Condition Number Estimates for Real Polynomial Systems I: A Broader Family of Distributions.

[BibT_eX]

[DOI]

Alperen Ali Ergür

Found. Comput. Math., 2019

A Faster Solution to Smale's 17th Problem I: Real Binomial Systems.

[BibT_eX]

[DOI]

Kaitlyn Phillipson

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces.

[BibT_eX]

[DOI]

J. Complex., 2018

Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis.

[BibT_eX]

[DOI]

Alperen Ali Ergür

CoRR, 2018

Dedekind Zeta Zeroes and Faster Complex Dimension Computation.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Sparse univariate polynomials with many roots over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2017

Counting Roots of Polynomials Over Prime Power Rings.

[BibT_eX]

[DOI]

CoRR, 2017

New Subexponential Fewnomial Hypersurface Bounds.

[BibT_eX]

[DOI]

Jens Forsgård

Mounir Nisse

CoRR, 2017

2016

Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Jingguo Bi

Qi Cheng

SIAM J. Comput., 2016

A-Discriminants for Complex Exponents and Counting Real Isotopy Types.

[BibT_eX]

[DOI]

Korben Rusek

CoRR, 2016

2015

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving.

[BibT_eX]

[DOI]

Proceedings of the Green in Software Engineering, 2015

2013

Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent.

[BibT_eX]

[DOI]

Pascal Koiran

Natacha Portier

CoRR, 2013

Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving.

[BibT_eX]

[DOI]

CoRR, 2013

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields.

[BibT_eX]

[DOI]

Jingguo Bi

Qi Cheng

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Faster p-adic feasibility for certain multivariate sparse polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

2011

Optimizing n-variate (n+k)-nomials for small k.

[BibT_eX]

[DOI]

Philippe P. Pébay

David C. Thompson

Theor. Comput. Sci., 2011

Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond.

[BibT_eX]

[DOI]

Osbert Bastani

Christopher J. Hillar

Dimitar Popov

CoRR, 2011

2010

Near NP-Completeness for Detecting p-adic Rational Roots in One Variable

[BibT_eX]

[DOI]

CoRR, 2010

Fewnomial Systems with Many Roots, and an Adelic Tau Conjecture.

[BibT_eX]

[DOI]

Kaitlyn Phillipson

CoRR, 2010

Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Optimization and NP_R-completeness of certain fewnomials.

[BibT_eX]

[DOI]

Philippe P. Pébay

David C. Thompson

Proceedings of the Symbolic Numeric Computation, 2009

Faster real feasibility via circuit discriminants.

[BibT_eX]

[DOI]

Frédéric Bihan

Casey E. Stella

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008

Book Review S. Basu, R. Pollack, and M.-F. Roy: Algorithms in Real Algebraic Geometry.

[BibT_eX]

[DOI]

Found. Comput. Math., 2008

2007

New Complexity Bounds for Certain Real Fewnomial Zero Sets

[BibT_eX]

[DOI]

Joel Gomez

Andrew Niles

CoRR, 2007

2005

Practical conversion from torsion space to Cartesian space for in silico protein synthesis.

[BibT_eX]

[DOI]

Charlie E. M. Strauss

J. Comput. Chem., 2005

On solving univariate sparse polynomials in logarithmic time.

[BibT_eX]

[DOI]

Yinyu Ye

J. Complex., 2005

Efficiently Detecting Torsion Points and Subtori

[BibT_eX]

[DOI]

CoRR, 2005

2004

High probability analysis of the condition number of sparse polynomial systems.

[BibT_eX]

[DOI]

Gregorio Malajovich

Theor. Comput. Sci., 2004

New Complexity Thresholds for Sparse Real Polynomials and A-discriminants

[BibT_eX]

[DOI]

Casey E. Stella

CoRR, 2004

2003

Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces.

[BibT_eX]

[DOI]

Tien-Yien Li

Xiaoshen Wang

Discret. Comput. Geom., 2003

A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture

[BibT_eX]

[DOI]

CoRR, 2003

The Exact Rational Univariate Representation for Detecting Degeneracies.

[BibT_eX]

[DOI]

John Keyser

Koji Ouchi

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002

Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001

Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

2000

Uncomputably large integral points on algebraic plane curves?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Some Speed-Ups and Speed Limits for Real Algebraic Geometry.

[BibT_eX]

[DOI]

J. Complex., 2000

1999

Solving Degenerate Sparse Polynomial Systems Faster.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On the Complexity of Diophantine Geometry in Low Dimensions (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

A new approach to counting Nash equilibria.

[BibT_eX]

[DOI]

Proceedings of the IEEE/IAFE 1997 Computational Intelligence for Financial Engineering, 1997

1996

Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes.

[BibT_eX]

[DOI]

Xiaoshen Wang

J. Complex., 1996

1994

A Convex Geometric Approach to Counting the Roots of a Polynomial System.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1991

An Optimal Condition for Determining the Exact Number of Roots of a Polynomial System.

[BibT_eX]

[DOI]

John F. Canny