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 601–700 of 865
Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming
Behrends, S. (2017) · doi:10.53846/goediss-6621 · Cited by 2
computation of general equilibria (new developments)
Kübler, F. (2008) · The New Palgrave Dictionary of Economics · doi:10.1057/9780230226203.0284 · Cited by 2
Quantifier Elimination for Deduction in Econometrics
Mulligan, C. B. (2018) · National Bureau of Economic Research · doi:10.3386/w24601 · Cited by 2
Level lines of a polynomial in the planePreprint
Bruno, A. D., & Batkhin, A. B. (2021) · Keldysh Institute Preprints · doi:10.20948/prepr-2021-57 · Cited by 2
Algebraic aspects of homogeneous Kuramoto oscillatorsPreprint
Harrington, H., Schenck, H., & Stillman, M. (2025) · Mathematics of Computation · doi:10.1090/mcom/4072 · Cited by 3
Identifiability of directed Gaussian graphical models with one latent sourcePreprint
Leung, D., Drton, M., & Hara, H. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.01583 · Cited by 2
“By Sard’s theorem (Basu et al., 2006, p. 192), f(C), and thus also f(C), has dimension less than n.”
BackgroundQuantifier elimination for elementary geometry and elementary affine geometry
Grimson, R., Kuijpers, B., & Othman, W. (2012) · Mathematical logic quarterly · doi:10.1002/malq.201100095 · Cited by 1
Fraction-free computation of the unit-circle resultant with any singularity profile
Bistritz, Y., & Lifshitz, A. (2019) · Linear and Multilinear Algebra · doi:10.1080/03081087.2019.1632253 · Cited by 1
Time and space efficient collinearity indexing
Aronov, B. S., Ezra, E. E., Sharir, M., et al. (2022) · Computational Geometry · doi:10.1016/j.comgeo.2022.101963 · Cited by 1
An Elementary Proof for the Existence of Limit Cycle in Three Gene Cyclic Regulatory Network
Mohanty, S., Mohit, A., Aggarwal, M., & Sen, S. (2023) · Indian Control Conference · doi:10.1109/icc61519.2023.10442884 · Cited by 1
Parametric “non-nested” discriminants for multiplicities of univariate polynomials
Hong, H., & Yang, J. (2024) · Science China Mathematics · doi:10.1007/s11425-023-2143-3 · Cited by 1
Real solutions to systems of polynomial equations in Macaulay2
Garcia, J. L., Maluccio, K., Sottile, F., et al. (2024) · Journal of Software for Algebra and Geometry · doi:10.2140/jsag.2024.14.87 · Cited by 1
Fast evaluation and root finding for polynomials with floating-point coefficients
Imbach, R., & Moroz, G. (2024) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2024.102372 · Cited by 1
Termination and Universal Termination Problems for Nondeterministic Quantum Programs
Xu, M., Fu, J., Jiang, H., Deng, Y., & Li, Z.-B. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3691632 · Cited by 1
Orbit-finite Linear Programming
Ghosh, A., Hofman, P., & Lasota, S. (2024) · Journal of the ACM · doi:10.1145/3703909 · Cited by 1
Rock Extensions with Linear Diameters
Kaibel, V., & Kukharenko, K. (2024) · SIAM Journal on Discrete Mathematics · doi:10.1137/23m1585878 · Cited by 1
Finite Decimal Fractions As Entries of Nonsingular Matrices
Abramov, S. A., & Ryabenko, A. A. (2025) · Programming and Computer Software · doi:10.1134/s0361768824700920 · Cited by 2
The convex algebraic geometry of higher-rank numerical ranges
Niño-Cortés, J., & Vinzant, C. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102457 · Cited by 1
A geometric approach to cylindrical algebraic decomposition
Chen, R. (2025) · Mathematics of Computation · doi:10.1090/mcom/4099 · Cited by 6
Stachó, L. L. (2025) · AppliedMath · doi:10.3390/appliedmath5030083 · Cited by 1
Computing positive tropical varieties and lower bounds on the number of positive roots
Rose, K., & Telek, M. L. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102477 · Cited by 1
“It is known that the field of formal real Puiseux series is a real closed field [6, Theorem 2.91].”
InfluentialEffective criteria for entanglement witnesses in small dimensions
Grzelka, Ł., Skowronek, Ł., & Życzkowski, K. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae0c49 · Cited by 1
k-Positive Maps: New Characterizations and a Generation Method
Ende, F. V., Khatri, S., & Denisov, S. (2025) · Open Systems & Information Dynamics · doi:10.1142/s1230161225500155 · Cited by 4
Multistability of small zero-one reaction networks
Jiao, Y., Tang, X., & Zeng, X. (2025) · Journal of Mathematical Biology · doi:10.1007/s00285-025-02306-w · Cited by 6
Frustration-free fermionic systems: Finite-size scaling and band topology
Masaoka, R., Ono, S., Po, H. C., et al. (2026) · Physical review. B./Physical review. B · doi:10.1103/qv6d-dk21 · Cited by 1
Quantifier Elimination Meets Treewidth
Wu, H., Zhu, J., Goharshady, A. K., An, J., Xia, B., & Zhan, N. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-22752-2_19 · Cited by 1
Effective de Rham cohomology — The general case
Scheiblechner, P. (2018) · Communications in Contemporary Mathematics · doi:10.1142/s0219199718500670 · Cited by 5
Litow, B. E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14165-2_36 · Cited by 1
Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers
Passmore, G. O. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21401-6_12 · Cited by 1
“RCF is complete, decidable and admits effective elimination of quantifiers [3].”
BackgroundOn the Realizable Weaving Patterns of Polynomial Curves in $\mathbb R^3$
Basu, S., Dhandapani, R., & Pollack, R. M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_5 · Cited by 1
“We give here the basic definitions, and state the results that we need, referring the reader to [2] for details.”
BackgroundSelf-citationAn algebraic certificate for Budan’s theorem
Bembé, D. (2010) · Journal of Pure and Applied Algebra · doi:10.1016/j.jpaa.2010.08.016 · Cited by 2
Cibulka, J., Matoušek, J., & Paták, P. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-015-9695-9 · Cited by 1
Critical point methods and effective real algebraic geometry: new results and trends
Din, M. S. E. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465928 · Cited by 1
The Level Sets of Typical Games
Rowlett, J. (2014) · Notices of the American Mathematical Society · doi:10.1090/noti1150 · Cited by 1
Computing the topology of an arrangement of implicitly defined real algebraic plane curves
Caravantes, J., & González-Vega, L. (2008) · Journal of Zhejiang University. Science A · doi:10.1631/jzus.a08gmp01 · Cited by 1
Evaluating geometric queries using few arithmetic operations
Grimson, R., Heintz, J., & Kuijpers, B. (2012) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-012-0172-x · Cited by 1
“Let X := (X1, ...,Xn), U := (U1, ..., Um) and d, h ∈ N with d > 1 be as in Section 3.”
BackgroundInfluentialEfficient evaluation of specific queries in constraint databases
Grimson, R., Heintz, J., & Kuijpers, B. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.06.015 · Cited by 1
“Mutatis mutandis our upper-bound results may be applied to the sparse and dense representations of F1, . . . , Fs. Keywords: Constraint databases, Query evaluation, Computational complexity”
BackgroundUniqueness of equilibrium in the Haber synthesis of ammonia
Demirplak, M. (2013) · Journal of Mathematical Chemistry · doi:10.1007/s10910-013-0300-2 · Cited by 2
Σ K –constraints for Hybrid Systems
Korovina, M., & Kudinov, O. V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11486-1_20 · Cited by 1
Theorem of Three Circles in Coq
Zsidó, J. (2013) · Journal of Automated Reasoning · doi:10.1007/s10817-013-9299-0 · Cited by 1
“Our area of interest is algorithmic real algebraic geometry, for which [1] is our main reference hereinafter.”
BackgroundInfluentialSolvability of Matrix-Exponential Equations
Ouaknine, J., Pouly, A., Sousa-Pinto, J., et al. (2016) · Proceedings - Symposium on Logic in Computer Science · doi:10.1145/2933575.2934538 · Cited by 1
“See (Renegar 1992) and (Basu et al. 2006) for more efficient decision procedures for the first-order theory of reals.”
Explaining Boris Pasternak's observation that complex ideas are sometimes easier to understand
Kosheleva, O. M., & Крейнович, В. (2016) · Journal of Innovative Technology and Education · doi:10.12988/jite.2016.51018 · Cited by 1
A Basic Result on the Theory of Subresultants
Akritas, A. G., Malaschonok, G., & Vigklas, P. S. (2017) · Serdica Journal of Computing · doi:10.55630/sjc.2016.10.31-48 · Cited by 1
Representations and evaluation strategies for feasibly approximable functions
Konečný, M., & Neumann, E. (2020) · Computability · doi:10.3233/com-180234 · Cited by 1
An SDP-based Method for the Real Radical Ideal Membership Test
Wang, F., Reid, G. J., & Wolkowicz, H. (2017) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2017.00025 · Cited by 1
Betti numbers of random hypersurface arrangements
Basu, S., Lerario, A., & Natarajan, A. (2022) · Journal of the London Mathematical Society · doi:10.1112/jlms.12658 · Cited by 1
Self-citationAverage-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field
Giménez, N., Matera, G., Pérez, M., et al. (2021) · Combinatorics Probability Computing · doi:10.1017/s0963548321000274 · Cited by 1
An optimal quantum error-correcting procedure using quantifier elimination
Sun, Y.-J., Xu, M., & Deng, Y. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03109-w · Cited by 1
Green computing: three examples of how non-trivial mathematical analysis can help
Крейнович, В., & Kosheleva, O. M. (2021) · Journal of Smart Environments and Green Computing · doi:10.20517/jsegc.2021.11 · Cited by 1
Certified Hermite matrices from approximate roots
Akoglu, T. A., & Szántó, Á. (2022) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2022.12.001 · Cited by 1
“The classical univariate Hermite Theorem [16] was generalized to the multivariate case by Pedersen, Roy and Szpirglas [20], and was also proved in [7] and [11]: Theorem 2.”
BackgroundMethodA constructive formalisation of Semi-algebraic sets and functions
Djalal, B. (2017) · doi:10.1145/3176245.3167099 · Cited by 1
Stability analysis of a bacterial growth model through computer algebra
Yabo, A. G., Din, M. S. E., Caillau, J.-B., & Gouzé, J. (2023) · MathematicS In Action · doi:10.5802/msia.37 · Cited by 2
CFMA for Gaussian MIMO Multiple Access Channels
Zhang, L., Evans, J., & Zhu, J. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10207001 · Cited by 1
Topological classification of the intersection curves of two quadrics using a set of discriminants
Shao, W., & Chen, F. (2023) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2023.102244 · Cited by 1
Symbolic Computation of an Arbitrary-Order Resonance Condition in a Hamiltonian System
Batkhin, A. B., & Khaidarov, Z. K. (2023) · Programming and Computer Software · doi:10.1134/s0361768823080030 · Cited by 1
“For all roots of polynomial f ( μ ) of degree n to be real and nonpositive , it is necessary and sufficient that the following conditions hold : (4) where is the kth subdiscriminant of polynomial f ( μ ) [5, 6].”
Integer Levinson Algorithm for the Inversion of Any Nonsingular Hermitian Toeplitz Matrix
Bistritz, Y., & Dekel, I. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3364574 · Cited by 1
On the Complexity of Chow and Hurwitz Forms
Dogan, M. L., Ergür, A. A., & Tsigaridas, E. (2023) · ACM communications in computer algebra · doi:10.1145/3653002.3653003 · Cited by 1
Distinct distances in R 3 between quadratic and orthogonal curves
Aldape, T., Liu, J., Pylypovych, G., Sheffer, A., & Vo, M.-Q. (2024) · European Journal of Combinatorics · doi:10.1016/j.ejc.2024.103993 · Cited by 2
Bounded-Memory Strategies in Partial-Information Games
Bose, S., Ibsen-Jensen, R., & Totzke, P. (2024) · Proceedings - Symposium on Logic in Computer Science · doi:10.1145/3661814.3662096 · Cited by 1
New Bounds for the Same-Type Lemma
Bukh, B., & Vasileuski, A. (2024) · The Electronic Journal of Combinatorics · doi:10.37236/12414 · Cited by 1
Quantum Automata and Languages of Finite Index
Benso, A., D’Alessandro, F., & Papi, P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72621-7_7 · Cited by 1
Monotonicity properties for Bernoulli percolation on layered graphs— A Markov chain approach
König, P., & Richthammer, T. (2024) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2024.104549 · Cited by 1
Positivstellensätze and Moment Problems with Universal Quantifiers
Hu, X., Klep, I., & Nie, J. (2025) · Mathematics of Operations Research · doi:10.1287/moor.2024.0402 · Cited by 3
“A quantifier-free description for K can be obtained by applying symbolic computations like cylindrical algebraic decompositions (see [3]).”
Computing local minimizers in polynomial optimization under genericity conditions
Hieu, V. T., & Takeda, A. (2025) · Journal of Global Optimization · doi:10.1007/s10898-025-01500-w · Cited by 1
“Besides, symbolic/exact algorithms can be used to compute global minima or infima such as quantifier eliminat-ions by Basu, Pollack, and Roy in [8], or without using quantifier eliminations by Safey El Din in [9].”
Phase Retrieval with Semialgebraic and ReLU Neural Network Priors
Bendory, T., Dym, N., Edidin, D., & Suresh, A. (2025) · SIAM Journal on Mathematics of Data Science · doi:10.1137/23m161731x · Cited by 6
Oscillatory Integral Operators and Variable Schrödinger Propagators: Beyond the Universal Estimates
Chen, M., Gan, S., Guo, S., et al. (2025) · Geometric and Functional Analysis · doi:10.1007/s00039-025-00724-y · Cited by 1
Overdetermined Strata for Degree 5 Hyperbolic Polynomials
Ezzaldine, H., Khalil, H., Mouhamad, S., et al. (2014) · Vietnam Journal of Mathematics · doi:10.1007/s10013-014-0079-x · Cited by 1
Hirai, H., & Yabe, A. (2015) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2015.02.005 · Cited by 1
NUROA: A numerical roadmap algorithm
Iraji, R., & Chitsaz, H. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040227 · Cited by 5
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem
Basu, S., & Zell, T. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.70 · Cited by 1
Self-citationEuler characteristic reciprocity for chromatic, flow and order polynomials
Hasebe, T., Miyatani, T., & Yoshinaga, M. (2017) · Journal of Singularities · doi:10.5427/jsing.2017.16k · Cited by 2
“If f is semialgebraic then the pull-back f−1(Y ) and the image f(X) are also semialgebraic sets (see [2, 5] for details).”
BackgroundDetailed Solutions to the Exercises
Yengui, I. (2015) · Lecture notes in mathematics · doi:10.1007/978-3-319-19494-3_6 · Cited by 1
Detecting Sums of Hermitian Squares
Burgdorf, S., Klep, I., & Povh, J. (2016) · SpringerBriefs in mathematics · doi:10.1007/978-3-319-33338-0_2 · Cited by 1
Feasibility of Single-Beam Interference Alignment in Multi-Carrier Interference Channels
Grant, D., & Varanasi, M. K. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2734651 · Cited by 1
On $$\mu $$μ-Symmetric Polynomials and D-Plus
Yang, J., & Yap, C. K. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96418-8_57 · Cited by 1
First-Order Continuous Induction and a Logical Study of Real Closed Fields
Salehi, S., & Zarza, M. (2019) · Bulletin of the Iranian Mathematical Society. · doi:10.1007/s41980-019-00252-0 · Cited by 1
Decision problem for a class of univariate Pfaffian functions
Barbagallo, M. L., Jeronimo, G., & Sabia, J. (2022) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-022-00545-8 · Cited by 1
“If both degrees are zero, it suffices to apply an algorithm for univariate real polynomials ([4]).”
Computation of the Fundamental Units of Number Rings Using a Generalized Continued Fraction
Bruno, A. D. (2019) · Programming and Computer Software · doi:10.1134/s036176881902004x · Cited by 1
Decision and optimization problems in the unreliable-circuit logic
Rasga, J., Sernadas, C., Mateus, P., et al. (2017) · Logic Journal of IGPL · doi:10.1093/jigpal/jzx005 · Cited by 1
“Then cycle 1(f) returns immediately (1, (v, 23 , 19 27 )).”
InfluentialDetermining Passivity via Quantifier Elimination
Voßwinkel, R., Mihailescu-Stoica, D., Schrödel, F., & Röbenack, K. (2019) · Mediterranean Conference on Control and Automation (MED) · doi:10.1109/med.2019.8798571 · Cited by 2
Polynomial interrupt timed automata: Verification and expressiveness
Bérard, B., Haddad, S., Picaronny, C., Din, M. S. E., & Sassolas, M. (2020) · Information and Computation · doi:10.1016/j.ic.2020.104580 · Cited by 1
Numerical roadmap of smooth bounded real algebraic surface
Chen, C., Wu, W., & Feng, Y. (2020) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2020.101858 · Cited by 3
Röbenack, K., & Gerbet, D. (2020) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit49905.2020.9263829 · Cited by 1
Divisibility of spheres with measurable pieces
Conley, C. T., Grebík, J., & Pikhurko, O. (2024) · L’Enseignement Mathématique · doi:10.4171/lem/1058 · Cited by 1
Complexity, Exactness, and Rationality in Polynomial Optimization
Bienstock, D., Pia, A. D., & Hildebrand, R. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-73879-2_5 · Cited by 1
Passivity and Maximum Quality Factor Assessment in Lossy 2-Port Transfer Functions
Oldoni, M., Seyfert, F., Mejillones, S. C., et al. (2021) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2021.3089428 · Cited by 1
Level Lines of a Polynomial on a Plane
Bruno, A. D., & Batkhin, A. B. (2022) · Programming and Computer Software · doi:10.1134/s0361768822010030 · Cited by 1
Data Generation With Prospect: A Probability Specification Tool
Ismaiel, A., Ruchkin, I., Sokolsky, O. V., et al. (2021) · Winter Simulation Conference · doi:10.1109/wsc52266.2021.9715363 · Cited by 1
Yengui, I. (2015) · Lecture notes in mathematics · doi:10.1007/978-3-319-19494-3_5 · Cited by 1
Nisse, M., & Sottile, F. (2022) · Pacific Journal of Mathematics · doi:10.2140/pjm.2022.317.187 · Cited by 3
“Properties of semi-algebraic sets are developed throughout the books [1, 4].”
BackgroundBiological homochirality and stoichiometric network analysis: Variations on Frank’s model
Ágreda, J. A., Montoya, J. A., & Mejía, C. (2022) · Revista Colombiana de Química · doi:10.15446/rev.colomb.quim.v50n3.96921 · Cited by 1
Interactions of zeros of polynomials and multiplicity matrices
Nathanson, M. B. (2022) · Journal of Algebra · doi:10.1016/j.jalgebra.2022.09.016 · Cited by 1
Geometry of Secure Two-party Computation
Basu, S., Khorasgani, H. A., Maji, H. K., et al. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs54457.2022.00101 · Cited by 1
Self-citationEmbedded Finite Models beyond Restricted Quantifier Collapse
Benedikt, M., & Hrushovski, E. (2023) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics56636.2023.10175804 · Cited by 1
“This contrasts with theories such as real closed fields, where doubly exponential bounds are known [28].”
A Note on the Complexity of Real Algebraic Hypersurfaces
Kerber, M., & Sagraloff, M. (2011) · Graphs and Combinatorics · doi:10.1007/s00373-011-1020-7 · Cited by 1
Everything is a matter of degree: A new theoretical justification of Zadeh’s principle
Nguyen, H. T., & Крейнович, В. (2008) · Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) · doi:10.1109/nafips.2008.4531303 · Cited by 1
“And indeed, in fuzzy logic with the set of truth values [0] [1] and the negation operation f ¬ (x) = 1 − x, there s a value which is invariant under the operation A → ¬A: the value 0.5.”
BackgroundInfluentialBerberich, E., & Sagraloff, M. (2008) · ACM Symposium on Solid and Physical Modeling (SPM) · doi:10.1145/1364901.1364925 · Cited by 1
Quantity Precommitment and Bertrand Competition: A Dynamic Games ApproachPreprint
Renner, P. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2560641 · Cited by 1
Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
Bank, B., Giusti, M., & Heintz, J. (2013) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/604/12068 · Cited by 1
SYNAPS: A Library for Dedicated Applications in Symbolic Numeric Computing
Mourrain, B., Pavone, J.-P., Trébuchet, P., et al. (2008) · The IMA volumes in mathematics and its applications · doi:10.1007/978-0-387-78133-4_6 · Cited by 1
“[3, 36] Let f, g ∈ Z[x], where f is square-free and f ′”
BackgroundMethod
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.