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 401–500 of 865
Bounding the radii of balls meeting every connected component of semi-algebraic setsPreprint
Basu, S., & Roy, M.-F. (2009) · arXiv (Cornell University) · doi:10.1016/j.jsc2010.06.009 · Cited by 6
Self-citationRegular cylindrical algebraic decomposition
Davenport, J. H., Locatelli, A., & Sankaran, G. K. (2019) · Journal of the London Mathematical Society · doi:10.1112/jlms.12257 · Cited by 7
Half-trek criterion for identifiability of latent variable models
Barber, R. F., Drton, M., Sturma, N., & Weihs, L. (2022) · The Annals of Statistics · doi:10.1214/22-aos2221 · Cited by 5
“For background on semialgebraic sets we refer to Bochnak et al. (1998), Basu et al. (2006) and Benedetti and Risler (1990).”
BackgroundMethodInfluentialBykov, D. A., Bezus, E. A., Mingazov, A. A., et al. (2024) · Physical Review A · doi:10.1103/physreva.109.053525 · Cited by 5
“A classic algorithm for solving algebraic equations (and finding the dimension of the solution set) is the cylindrical algebraic decomposition (CAD) [23].”
BackgroundMethodSmooth connectivity in real algebraic varieties
Cummings, J., Hauenstein, J. D., Hong, H., et al. (2024) · Numerical Algorithms · doi:10.1007/s11075-024-01952-3 · Cited by 5
Complexity of linear relaxations in integer programming
Averkov, G., & Schymura, M. (2021) · Mathematical Programming · doi:10.1007/s10107-021-01623-4 · Cited by 5
Subset selection for matrices with fixed blocks
Xie, J., & Xu, Z. (2021) · Israel Journal of Mathematics · doi:10.1007/s11856-021-2171-8 · Cited by 10
More on lines in Euclidean Ramsey theory
Conlon, D., & Wu, Y. (2023) · Comptes Rendus Mathématique · doi:10.5802/crmath.452 · Cited by 5
“The second result we need is the Oleinik–Petrovsky–Thom–Milnor theorem (see, for example, [3]), which, for N fixed, gives a polynomial bound for the number of sign patterns.”
BackgroundComplete Neural Networks for Complete Euclidean Graphs
Hordan, S., Amir, T., Gortler, S. J., & Dym, N. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i11.29141 · Cited by 29
Inverse problems are solvable on real number signal processing hardware
Boche, H., Fono, A., & Kutyniok, G. (2024) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2024.101719 · Cited by 16
Computing the Fréchet distance between folded polygons
Cook, A. F., Driemel, A., Sherette, J., et al. (2015) · Computational Geometry · doi:10.1016/j.comgeo.2015.08.002 · Cited by 5
“These quantifiers can be removed using quantifier elimination as described by [BPR06] in Section 14 .”
MethodInfluentialPolynomial Interrupt Timed Automata
Bérard, B., Haddad, S., Picaronny, C., Din, M. S. E., & Sassolas, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24537-9_3 · Cited by 7
A root isolation algorithm for sparse univariate polynomials
García, M. E. A., & Galligo, A. (2012) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2442829.2442839 · Cited by 5
“On the one hand the concept of sparse representations and more particularly of fewnomial play a crucial role in modern real algebraic geometry and in complexity theory, see [4, 2].”
BackgroundMethodInfluentialA parametric representation of totally mixed Nash equilibria
Jeronimo, G., Perrucci, D., & Sabia, J. (2009) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2009.06.043 · Cited by 5
Revisiting Zariski Main Theorem from a constructive point of view
García, M. E. A., Coquand, T., & Lombardi, H. (2014) · Journal of Algebra · doi:10.1016/j.jalgebra.2014.02.003 · Cited by 5
Equivalence checking of quantum finite-state machines
Wang, Q., Liu, J., & Ying, M. (2020) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2020.08.004 · Cited by 5
Measuring the local non-convexity of real algebraic curves
Sorea, M. (2020) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2020.07.017 · Cited by 17
Milici, P. (2019) · Computability · doi:10.3233/com-180208 · Cited by 5
“…to lie on the rod passing through the origin and ( 1 , x 2 ) onRod(parall(0,0,[1]),0,[2]) P [ 2 ] is constrained on the rod parallel to the x -axis passing through (x 1 , x 1 · x 2 ) onRod(perp(0,0,0),0,[2]) the sought point is the one obtained inverting ab-scissa and ordinate of P [ 2 ] Proof.”
InfluentialA new general formula for the Cauchy index on an interval with subresultants
Perrucci, D., & Roy, M.-F. (2020) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2020.07.016 · Cited by 5
“Theorem 8 is a generalization of the classical Sturm theorem [8, 3], since a or b can be root of P or Q (but not of both).”
BackgroundMethodSelf-citationInvariance of a class of semi-algebraic sets for polynomial systems with dynamic compensators
Yuno, T., Zerz, E., & Ohtsuka, T. (2020) · Automatica · doi:10.1016/j.automatica.2020.109243 · Cited by 5
Algebro-Geometric Equisingularity of Zariski
Parusiński, A. (2021) · Springer eBooks · doi:10.1007/978-3-030-78024-1_4 · Cited by 4
“We recall the notion of generalized discriminants, see Appendix IV of [79], [3], [61], or Appendix B of [52].”
BackgroundGerbet, D., & Röbenack, K. (2020) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit49905.2020.9263958 · Cited by 5
Hausdorff approximations and volume of tubes of singular algebraic sets
Basu, S., & Lerario, A. (2022) · Mathematische Annalen · doi:10.1007/s00208-022-02458-w · Cited by 5
Self-citationHubert, É., Metzlaff, T., Moustrou, P., et al. (2024) · Mathematical Programming · doi:10.1007/s10107-024-02149-1 · Cited by 5
Soft Subdivision Search in Motion Planning, II: Axiomatics
Yap, C. K. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-19647-3_2 · Cited by 5
“Divergent paths have been taken: theoreticians favor the Exact Approach [2], but practical roboticists prefer the Sampling and Subdivision Approaches [9,11].”
BackgroundTopological invariance of the combinatorial Euler characteristic of tame spaces
Beke, T. (2011) · Homology Homotopy and Applications · doi:10.4310/hha.2011.v13.n2.a11 · Cited by 5
“For semi-algebraic sets, these were introduced by Collins; see Basu-Pollack-Roy [BPR06] Ch. 5.”
MethodLeón, E., & Ziegler, G. M. (2018) · Bolyai Society mathematical studies · doi:10.1007/978-3-662-57413-3_11 · Cited by 5
Bivariate triangular decompositions in the presence of asymptotes
Lazard, S., Pouget, M., & Rouillier, F. (2017) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2017.01.004 · Cited by 5
Selivanova, S., & Selivanov, V. (2021) · Computability · doi:10.3233/com-180215 · Cited by 5
“Algorithms used in mathematics-oriented software can be divided into two big classes: symbolic algorithms (e.g. [6,10]) which aim to find precise solutions, and approximate algorithms (e.g. [4,17,19,39]) which aim to find “good enough” approximations to precise solutions.”
Algorithms for computing cubatures based on moment theory
Collowald, M., & Hubert, É. (2018) · Studies in Applied Mathematics · doi:10.1111/sapm.12240 · Cited by 6
Escorcielo, P., & Perrucci, D. (2016) · Journal of Complexity · doi:10.1016/j.jco.2016.12.001 · Cited by 5
“Remark 10 Following the notation in Theorem 3, suppose that r > 2 and that there exist at least k distinct pairs of roots (vγ(1), vδ(1)), .”
BackgroundConnectedness of the solution set of the tensor complementarity problem
Li, Y., Huang, Z., & Hu, S. (2020) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2020.123965 · Cited by 5
Primitive recursive ordered fields and some applications
Selivanov, V., & Selivanova, S. (2022) · Computability · doi:10.3233/com-210386 · Cited by 5
Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials
Dias, L. R. G. (. R. G. )., Joiţa, C. (., & Tibăr, M. (. (2021) · LillOA (Université de Lille (University Of Lille)) · Cited by 5
Graph Reconstruction from Unlabeled Edge Lengths
Garamvölgyi, D., & Jordán, T. (2021) · Discrete & Computational Geometry · doi:10.1007/s00454-021-00275-7 · Cited by 5
Chistikov, D. V., Kiefer, S., Murawski, A. S., et al. (2022) · Logical Methods in Computer Science · doi:10.46298/lmcs-18(1:40)2022 · Cited by 5
Real closures of models of weak arithmetic
Jeřábek, E., & Kołodziejczyk, L. A. (2012) · Archive for Mathematical Logic · doi:10.1007/s00153-012-0311-x · Cited by 5
Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image
Pluta, K., Moroz, G., Kenmochi⋆, Y., & Romon, P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45641-6_27 · Cited by 7
“The state-of-the-art techniques such as cylindrical algebraic decomposition or critical point method [3] are burdened by double exponential [5] and exponential [26] complexity respectively, with respect to the number of variables.”
Tropical varieties for exponential sums
Ergür, A. A., Paouris, G., & Rojas, J. M. (2019) · Mathematische Annalen · doi:10.1007/s00208-019-01808-5 · Cited by 6
GENERIC UNLABELED GLOBAL RIGIDITY
GORTLER, S. J., THERAN, L., & Thurston, D. P. (2019) · Forum of Mathematics Sigma · doi:10.1017/fms.2019.16 · Cited by 10
A Formal Quantifier Elimination for Algebraically Closed Fields
Cohen, C., & Mahboubi, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14128-7_17 · Cited by 15
Lima, A. D. C. (1927) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.24037 · Cited by 5
A Logic for Quantum Circuits and Protocols
Patra, M. K. (2005) · Lecture notes in computer science · doi:10.1007/11560647_28 · Cited by 6
Scenario-Based Verification of Uncertain MDPs
Cubuktepe, M. (2021) · doi:10.26226/morressier.604907f51a80aac83ca25d97 · Cited by 5
When a system of real quadratic equations has a solution
Barvinok, A. I., & Rudelson, M. (2022) · Advances in Mathematics · doi:10.1016/j.aim.2022.108391 · Cited by 4
Persistent Homology of Semialgebraic Sets
Basu, S., & Karisani, N. (2023) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/22m1494415 · Cited by 6
Self-citationStability of singular limit cycles for Abel equations revisited
Bravo, J. L., Fernández, M., & Ojeda, I. (2023) · Journal of Differential Equations · doi:10.1016/j.jde.2023.10.003 · Cited by 4
(Re)packing Equal Disks into Rectangle
Fomin, F. V., Golovach, P. A., Inamdar, T., et al. (2024) · Discrete & Computational Geometry · doi:10.1007/s00454-024-00633-1 · Cited by 4
“We refer to the book of Basu, Pollack, and Roy [5] for basic tools.”
MethodInfluentialAlgebraic Tools for Computing Polynomial Loop Invariants
Bayarmagnai, E., Mohammadi, F., & Prébet, R. (2024) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3666000.3669710 · Cited by 4
Absolute concentration robustness: Algebra and geometry
Puente, L. D. G., Gross, E., Harrington, H. A., Johnston, M., Meshkat, N., Millán, M. P., & Shiu, A. (2024) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2024.102398 · Cited by 16
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction
Chen, H., & Wrona, M. (2012) · International Symposium on Temporal Representation and Reasoning · doi:10.1109/time.2012.19 · Cited by 4
Recent Advances in Real Geometric Reasoning
Davenport, J. H., & England, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21362-0_3 · Cited by 4
GiNaCRA: A C++ Library for Real Algebraic Computations
Loup, U., & Ábrahám, E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20398-5_41 · Cited by 4
Iliopoulou, M. (2015) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2015.06.009 · Cited by 6
On The Limits of Finite-Time Distributed Consensus Through Successive Local Linear Operations
Coutiño, M., Isufi, E., Maehara, T., & Leus, G. J. T. (2018) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2018.8645186 · Cited by 4
Recent Advances in the Computation of the Homology of Semialgebraic Sets
Cucker, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22996-2_1 · Cited by 5
On types of degenerate critical points of real polynomial functions
Guo, F., & Phạm, T.-S. (2019) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2019.03.004 · Cited by 3
Basu, S., & Isik, U. (2020) · Forum of Mathematics Sigma · doi:10.1017/fms.2020.26 · Cited by 6
Self-citationAlmagor, S., Ouaknine, J., & Worrell, J. (2020) · Theory of Computing Systems · doi:10.1007/s00224-020-09976-7 · Cited by 5
An algebraic method to fidelity-based model checking over quantum Markov chains
Xu, M., Fu, J., Mei, J., et al. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.08.016 · Cited by 5
Interpolation and Model Checking for Nonlinear Arithmetic
Jovanović, D., & Dutertre, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81688-9_13 · Cited by 7
Gröbner bases and critical values: The asymptotic combinatorics of determinantal systems
Berthomieu, J., Bostan, A., Ferguson, A., et al. (2022) · Journal of Algebra · doi:10.1016/j.jalgebra.2022.03.002 · Cited by 4
“…deciding the emptiness of the set of real solutions of a polynomial system, counting the number of connected components of such sets and one block quantifier elimination can all be accomplished, under some regularity assumptions, by the so-called critical point method [3, Ch. 7], see also [19, 25].”
MethodAn approximate characterisation of the set of feasible trajectories for constrained flat systems
Greco, L., Mounier, H., & Bekcheva, M. (2022) · Automatica · doi:10.1016/j.automatica.2022.110484 · Cited by 4
Beyond the Existential Theory of the Reals
Schaefer, M., & Štefankovič, D. (2023) · Theory of Computing Systems · doi:10.1007/s00224-023-10151-x · Cited by 4
Open induction in a bounded arithmetic for TC0
Jeřábek, E. (2014) · Archive for Mathematical Logic · doi:10.1007/s00153-014-0414-7 · Cited by 3
Algebraic geometry of Poisson regression
Kahle, T., Oelbermann, K.-F., & Schwabe, R. (2016) · Journal of Algebraic Statistics · doi:10.18409/jas.v7i1.43 · Cited by 4
Projective Modules Over Polynomial Rings
Yengui, I. (2015) · Lecture notes in mathematics · doi:10.1007/978-3-319-19494-3_2 · Cited by 4
Resonance Set of a Polynomial and Problem of Formal Stability
Batkhin, A. B. (2016) · Mathematical Physics and Computer Simulation · doi:10.15688/jvolsu1.2016.4.1 · Cited by 4
On the Complexity of Computing the Topology of Real Algebraic Space Curves
Jin, K., & Cheng, J.-S. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-020-9164-2 · Cited by 4
Six papers on signatures, braids and Seifert surfaces
Ghys, É., & Ranicki, A. A. (2016) · Ensaios Matemáticos · doi:10.21711/217504322016/em301 · Cited by 4
The SARAG Library: Some Algorithms in Real Algebraic Geometry
Caruso, F. (2006) · Lecture notes in computer science · doi:10.1007/11832225_11 · Cited by 4
Realization Theory for Discrete-Time Semi-algebraic Hybrid Systems
Petreczky, M., & Vidal, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78929-1_28 · Cited by 4
“emptiness ofSa can be done using techniques from algebraic geometry, for example, by using procedures for deciding emptiness of semi-algebraic sets, see [26].”
MethodOptimizing n -variate ( n + k ) -nomials for small k
Pébaÿ, P., Rojas, J. M., & Thompson, D. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.11.053 · Cited by 4
Applications of dimensionality reduction and exponential sums to graph automorphism
Manjunath, M., & Sharma, V. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.03.014 · Cited by 4
Li, Q., Xu, X., & Sun, Y. (2014) · IET Control Theory and Applications · doi:10.1049/iet-cta.2014.0299 · Cited by 4
Berberich, E., & Sagraloff, M. (2009) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2009.03.006 · Cited by 5
Computational geometry of positive definiteness
Huhtanen, M., & Seiskari, O. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2012.05.002 · Cited by 4
“(For computational aspects of real algebraic geometry, see [4].)”
BackgroundA Formally Verified Conflict Detection Algorithm for Polynomial Trajectories
Narkawicz, A. J., & Munoz, C. A. (2015) · AIAA Infotech@Aerospace Conference · doi:10.2514/6.2015-0795 · Cited by 4
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
Köppe, M., & Zhou, Y. J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45587-7_29 · Cited by 4
Comparison of CAD-based Methods for Computation of Rational Function Limits
Strzeboński, A. (2018) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3208976.3208982 · Cited by 4
Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials
Dias, L. R. G., Joiţa, C., & Tibăr, M. (2021) · Mathematische Zeitschrift · doi:10.1007/s00209-020-02662-x · Cited by 4
Combinatorial complexity in O-minimal geometry
Basu, S. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250798 · Cited by 4
“The proof of Theorem 2.7 will follow from the following lemma (which corresponds to the rst projection step in the more familiar cylindrical algebraic decomposition algorithm for semi-algebraic sets (see for instance, [ 6 ])).”
BackgroundMethodResultInfluentialSelf-citationStructure of the resonance set of a real polynomialPreprint
Batkhin, A. B. (2016) · Keldysh Institute Preprints · doi:10.20948/prepr-2016-29 · Cited by 4
Computation of generalized discriminant of a real polynomialPreprint
Batkhin, A. B. (2017) · Keldysh Institute Preprints · doi:10.20948/prepr-2017-88 · Cited by 4
$$\forall \exists \mathbb {R}$$-Completeness and Area-Universality
Dobbins, M. G., Kleist, L., Miltzow, T., et al. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00256-5_14 · Cited by 3
Real-time computing and robust memory with deterministic chemical reaction networks
Fletcher, W., Klinge, T. H., Lathrop, J. I., et al. (2024) · Natural Computing · doi:10.1007/s11047-024-09994-1 · Cited by 3
“Observation 3.3 ALG is a real closed field (Basu et al. 2006).”
InfluentialAn unfeasibility view of neural network learning
Heintz, J., Pardo, L. M., Segura, E. C., et al. (2022) · Journal of Complexity · doi:10.1016/j.jco.2022.101710 · Cited by 3
Structure of the w -solution set of the tensor complementarity problem
Sharma, S., Palpandi, K., & Yadav, P. K. (2023) · Optimization · doi:10.1080/02331934.2023.2245406 · Cited by 3
THE EDGEWORTH AND GRAM–CHARLIER DENSITIES
Aschakulporn, P., & Zhang, J. E. (2024) · International Journal of Theoretical and Applied Finance · doi:10.1142/s0219024924500201 · Cited by 3
Complexity Invariance of Real Interpretations
Bonfante, G., & Deloup, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13562-0_14 · Cited by 2
“[3], the complexity of these algorithms is exponential with respect to the size of the program.”
BackgroundInvariant theoretic characterization of subdiscriminants of matrices
Domokos, M. (2013) · Linear and Multilinear Algebra · doi:10.1080/03081087.2012.762714 · Cited by 3
“47 in [1] yields an expression for the 1-subdiscriminant of 4 × 4 symmetric matrices as a sum of (10 3 ) = 120 squares.”
BackgroundInfluentialBlažková, E., & Šı́r, Z. (2014) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2014.05.006 · Cited by 3
Monitoring for a Decidable Fragment of MTL- $$\int $$
Pedro, A. D. M., Pereira, D., Pinho, L. M., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-23820-3_11 · Cited by 3
A Topological Method for Finding Invariant Sets of Continuous Systems
Fribourg, L., Goubault, É., Mohamed, S., et al. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24537-9_7 · Cited by 3
Real Algebraic Geometry for Geometric Constraints
Sitharam, M., John, A. S., & Sidman, J. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315121116-12 · Cited by 3
Robust Schur Stability of a Polynomial Matrix Family
Kalinina, E. A., Smol’kin, Y. A., & Uteshev, A. Y. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26831-2_18 · Cited by 3
Algebraic Degrees of 3-Dimensional Polytopes
Belotti, M., Joswig, M., & Panizzut, M. (2022) · Vietnam Journal of Mathematics · doi:10.1007/s10013-022-00559-2 · Cited by 4
Solving Parametric Polynomial Systems by RealComprehensiveTriangularize
Chen, C., & Maza, M. M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44199-2_76 · Cited by 3
Gutnik, S. A., & Sarychev, V. A. (2022) · Mathematics in Computer Science · doi:10.1007/s11786-022-00535-6 · Cited by 3
“We can also use recent work on the geometry of discriminants [18].”
MethodComputing roadmaps in unbounded smooth real algebraic sets I: Connectivity results
Prébet, R., Din, M. S. E., & Schost, É. (2023) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2023.102234 · Cited by 8
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.