Algorithms in Real Algebraic Geometry
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Existential Theory of the Reals
(2006) · Algorithms and computation in mathematics · doi:10.1007/3-540-33099-2_14 · Cited by 7
Computing Roadmaps and Connected Components of Semi-algebraic Sets
Basu, S., Pollack, R. M., & Roy, M.-F. (2003) · Algorithms and computation in mathematics · doi:10.1007/978-3-662-05355-3_17 · Cited by 1
Self-citationQuantitative Semi-algebraic Geometry
(2006) · Springer eBooks · doi:10.1007/3-540-33099-2_8 · Cited by 1
Cited by
Items 801–865 of 865
Thorsten Theobald: “Real Algebraic Geometry and Optimization”
Schweighofer, M. (2024) · Jahresbericht der Deutschen Mathematiker-Vereinigung · doi:10.1365/s13291-024-00288-0
Model Checking Markov Chains as Distribution Transformers
Aghamov, R., Baier, C., Karimov, T., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-75775-4_13
Ghitza, A., & Yamauchi, T. (2024) · Journal de Théorie des Nombres de Bordeaux · doi:10.5802/jtnb.1291
Resonances and Formal Stability Investigation in Hamiltonian Systems
Batkhin, A. B., & Khaydarov, Z. K. U. (2024) · Mathematics in Computer Science · doi:10.1007/s11786-024-00596-9
“Theorem 2.2 ([14]) All roots of the polynomial χ n (μ) of degree n are real and nonpositive iff It is a well-known fact that stability of a SP can be either destroyed or preserved by an arbitrary nonlinear perturbation.”
InfluentialHomogeneous form inequalities (I): Volume estimates and the generalised metric Oppenheim conjecturePreprint
Adiceam, F., & Marmon, O. (2024) · Transactions of the American Mathematical Society · doi:10.1090/tran/9359
Algebraic and algorithmic methods for computing polynomial loop invariants
Bayarmagnai, E., Mohammadi, F., & Prébet, R. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102551
The Geometry of Cylindrical Algebraic Decomposition
Chen, R. (2024) · ACM communications in computer algebra · doi:10.1145/3717582.3717586
“Due to space reasons, we refer readers to [BPR06, Page 139] for a precise definition of cylindrical algebraic decomposition.”
Semi-Algebraic Structure and Central Paths in Nonlinear Optimization
Basu, S., & Mohammad-Nezhad, A. (2024) · ACM communications in computer algebra · doi:10.1145/3717582.3717593
“In [1], we investigated the degree and the convergence rate of the central path from the perspective of algorithmic real algebraic geometry [3].”
Self-citationKapengut, E. B., Kiessling, M. K. ‐., Ling, E., et al. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01547-1
“Indeed, ˜ J ( η ) is an eighth degree polynomial, and an application of Sturm’s theorem [3, § 2.2.2] (which can be implemented algorithmically via a computer program) shows that ˜ J ( η ) has no zeros between η 0 and η 1 .”
InfluentialMichel, L., Nalbach, J., Mathonet, P., Zénaïdi, N., Brown, C. W., Ábrahám, E., Davenport, J. H., & England, M. (2024) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc65383.2024.00015 · Cited by 1
Quantitative approximate definable choices
Lerario, A., Rizzi, L., & Tiberio, D. (2025) · Mathematische Annalen · doi:10.1007/s00208-025-03128-3
On arrangements of quadrics in decomposing the parameter space of 3D digitized rigid motions
Pluta, K., Moroz, G., Kenmochi⋆, Y., et al. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102447
“The state-of-the-art techniques such as cylindrical algebraic decomposition or critical point method [12] are respectively burdened—with respect to the number of variables—by double exponential [13] and exponential [14] complexities.”
On One-Parameter Families of Hermiticity-Preserving Superoperators which Are Not Positive
Pastuszak, G., Jaworska-Pastuszak, A., & Kamizawa, T. (2025) · Open Systems & Information Dynamics · doi:10.1142/s1230161225500040
“Even though it is fully deterministic, its enormous complexity [22, Section 6] makes it hard to use in practice (we refer to [3, 5, 4] for more information about complexity of quantifier elimination).”
InfluentialUnique reconstruction problems in rigidity theory
Garamvölgyi, D. (2024) · Eötvös Loránd Tudományegyetem · doi:10.15476/elte.2024.150
Beyond Affine Loops: A Geometric Approach to Program Synthesis
Bayarmagnai, E., Mohammadi, F., & Prébet, R. (2025) · doi:10.1145/3735544.3735581
“A natural next step would be to explore the synthesis of more complex loop structures, such as branching and nested loops.”
Algorithms to prove the maximum number of MUBs in arbitrary dimension
Cifuentes, S., Ciancaglini, N., Bellomo, G., Figueira, S. D., & Bendersky, A. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04778-7 · Cited by 2
“The same applies if the number of blocks of quantifiers of the input formula is fixed [36].”
Certifying Solutions of Degenerate Semidefinite Programs
Kolmogorov, V., Naldi, S., & Zapata, J. (2025) · SIAM Journal on Optimization · doi:10.1137/24m1664691
Bounding the interleaving distance for mapper graphs with a loss function
Chambers, E. W., Munch, E., Percival, S., & Wang, B. (2025) · Journal of Applied and Computational Topology · doi:10.1007/s41468-025-00215-x · Cited by 3
“Given a semi-algebraic map f : X → R d with X semi-algebraic, and any semi-algebraic open set U We refer the reader to [4] for an overview of the basic properties of semi-algebraic sets and maps, from which this lemma easily follows.”
Hard submatrices for non-negative rank and communication complexity
Hrubeš, P. (2025) · Computational Complexity · doi:10.1007/s00037-025-00269-4
“We follow the monograph of Basu, Pollack and Roy [1].”
Mixed Nash Equilibria in Discrete Tullock Contests
Bilò, V., Mavronicolas, M., Spirakis, P. G., et al. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-03639-1_3
Covering Number of Real Algebraic Varieties and Beyond: Improved Bounds and Applications
Zhang, Y., & Kileel, J. (2025) · Foundations of Computational Mathematics · doi:10.1007/s10208-025-09735-5
Symbolic and Numerical Tools for L∞-Norm Calculation
Younes, G., Quadrat, A., & Rouillier, F. (2025) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2025.09.592
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
Agarwal, P. K., Ezra, E. E., & Sharir, M. (2025) · Discrete & Computational Geometry · doi:10.1007/s00454-025-00792-9
Ordered Fields and Grzegorczyk’s Hierarchy
Chilikov, L., & Selivanov, V. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-09645-6_3
Quantum algorithm for solving nonlinear algebraic equations
Nghiem, N. A., & Wei, T.-C. (2025) · Physical Review Applied · doi:10.1103/c4l1-9782 · Cited by 3
Faithlessness in Gaussian graphical models
Drton, M., Henckel, L., Hollering, B., et al. (2025) · Bernoulli · doi:10.3150/25-bej1873
Analogy and Its Surprises: An Eyewitness’s Reflections on the Emergence of Real Algebraic Geometry
Dickmann, M. (2011) · The Western Ontario series in philosophy of science · doi:10.1007/978-94-007-0214-1_12
Computing at Least One of Two Roots of a Polynomial is, in General, Not Algorithmic
Крейнович, В. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-46778-3_32
“, [1, 7, 9, 10].”
Constructive quantifier elimination with a focus on matrix rings
Illmer, M., & Netzer, T. (2025) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2025.103706
Cylindrical Algebraic Decomposition in Coq/Rocq
Vermande, Q. (2026) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3779031.3779100
“We will assume that the reader is familiar with the notion of subresultant, which we denote by sRes (see Section 4.2 in [1]).”
InfluentialThe nonlinear algebra view of discrete mathematics
Loera, J. A. D. (2025) · Proceedings of symposia in pure mathematics · doi:10.1090/pspum/111/02040
THE EXPRESSIVENESS AND COMPLEXITY LANDSCAPE FOR EVALUATING FORMULAS OVER EMBEDDED FINITE MODELS
Benedikt, M., & Hrushovski, E. (2026) · Journal of Symbolic Logic · doi:10.1017/jsl.2026.10195
Gröbner Bases and Nonlinear Polynomial Systems for the Layman
Alcázar, J. G. (2026) · The Mathematical Intelligencer · doi:10.1007/s00283-026-10507-4
Exact algorithms for determinantal varieties and semidefinite programming
Naldi, S. (2015) · theses.fr (ABES) · doi:10.70675/2e9d6fe2z1705z4204zbbaezea86f5846d60 · Cited by 6
Milici, P. (2015) · theses.fr (ABES) · doi:10.70675/66349e9dzb2f8z4625z8856z3a6d9c2f1c96 · Cited by 5
Bases of relations in one or several variables : fast algorithms and applications
Neiger, V. (2016) · theses.fr (ABES) · doi:10.70675/d8ca44b8zb45cz479az80a3zd34deb5c4454 · Cited by 6
Playing to Lose: Sub-Game-Perfect Equilibria in Three-Stage Contests with Non-Monotone PrizesPreprint
Bongiovi, M. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6530584
Exact Algorithms for Polynomial Optimisation
Ferguson, A. (2022) · theses.fr (ABES) · doi:10.70675/2a76e51fz3424z4dd3zbed1z94f95e805983
Stability in Hamiltonian Systems : steepness and regularity in Nekhoroshev theory
Barbieri, S. (2023) · theses.fr (ABES) · doi:10.70675/a63e0fd9zcf19z4975zac4fz384d20621ca1 · Cited by 1
Algorithmic and theoretical aspects of sparse deep neural networks
Le, Q.-T. (2023) · theses.fr (ABES) · doi:10.70675/01b91cd8zefbaz442az9887zbfcec3e1132f · Cited by 1
Convergence estimates in tropical geometry and application in optimization
Vandame, N. (2024) · theses.fr (ABES) · doi:10.70675/33f66093za39cz40edzafb1z46e6d4e65dc9
Geometric combinatorics of paths and deformations of convex polytopes
Poullot, G. (2023) · theses.fr (ABES) · doi:10.70675/52c8f85azdd31z4131zb76czebc6a150b12e
Sampling smooth points on real algebraic sets using perturbations
Harris, K. E., Hauenstein, J. D., & Hong, H. (2026) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2026.102584
A Routh Zero-Location Testing Method for Integer Polynomials With Any Singularity Profile
Bistritz, Y., & Weinberg, R. (2026) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2026.3691034
Further results on minimal and minimum cylindrical algebraic decompositions
Michel, L., Mathonet, P., & Zénaïdi, N. (2026) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2026.102587 · Cited by 1
Complete Collineations for Maximum Likelihood Estimation
Bérczi, G., Hamilton, E., Reichenbach, P., et al. (2026) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/24m1694793
Extremal Classification for Pairwise Linear Combinations of Third-Order Zernike Polynomials
Pearson, K., & Zhang, T. (2026) · Foundations · doi:10.3390/foundations6030035
Deng, M.-Y., Tang, Z.-H., & Tan, L.-Z. (2026) · Mathematics · doi:10.3390/math14132336
Computing the Connected Components of Real Algebraic Curves
Rocchi, E., & Din, M. S. E. (2026) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3815436.3815466
Faster Modular Composition Using Two Relation Matrices
Neiger, V., Salvy, B., Schost, É., et al. (2026) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3815436.3815451
Model Checking Matrix Product States Against Linear Chain Logic
Xu, M., Chen, Y., & Guan, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_17
Program Synthesis for Non-linear Real Arithmetic: Going Beyond Realizability
Akshay, S., Chakraborty, S., Govind, R., & Joshi, A. R. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32589-1_15
Properties of black holes in nonlinear electrodynamics
Anonymous, Gregory, R., Gupta, A., et al. (2026) · Physical review. D/Physical review. D. · doi:10.1103/qmjh-dzz8
What the Karpowicz Theorem Does Not Prove: A Three-Resource Theory of the LLM Einstein TestPreprint
Li, A. C. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6751920
Impossibility of perfect cheating for single-qubit position verification
Anonymous, & Alnawakhtha, Y. (2026) · Physical Review A · doi:10.1103/4pcn-d1yj
An Algebraic Approach to Analyze an MSEIR Epidemic Model
Otto, A., Amidou, M., & Salou, M. (2026) · Journal of Applied Mathematics · doi:10.1155/jama/5377650
Decidability, observational bridges and finite-information quantum gravity
Budiyanto, A. H. (2026) · International Journal of Modern Physics D · doi:10.1142/s0218271826500513
Exact Evaluation of Probabilistic Programs with Cylindrical Algebraic Decomposition
Bandukara, M. H., Dahlqvist, F., & Omidvari, N. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35298-9_5
Pierro, V., Fiumara, V., Granata, V., et al. (2026) · Physical review. D/Physical review. D. · doi:10.1103/v9rw-b3pf
Zheng, K., Liu, N., & Yu, Z. (2026) · Mathematical Methods in the Applied Sciences · doi:10.1002/mma.71007
Metadata
- Authors
- Basu, S., Pollack, R., & Roy, M.-F.
- Affiliations
- Georgia Institute of Technology (US)
- Courant Institute of Mathematical Sciences (US)
- Institut de recherche mathématique de Rennes (FR)
- Venue
- Algorithms and computation in mathematics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- ISSN
- 1431-1550 (ISSN-L)
- OpenAlex
- W4255213956
- Cited by
- 868
- References
- 3
- Citations by year
- 2026: 27 · 2025: 37 · 2024: 65 · 2023: 52 · 2022: 58 · 2021: 54 · 2020: 48 · 2019: 46 · 2018: 48 · 2017: 37 · 2016: 46 · 2015: 54 · 2014: 54 · 2013: 35 · 2012: 40
- FWCI
- 9.06
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithms and computation in mathematics (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Geometry and Topology › Algebraic Geometry and Number Theory
- Keywords
- real algebraic geometry, real root counting, polynomial systems, polynomial inequalities, global optimization, existence of solutions, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.