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 201–300 of 865
Density of algebraic points on Noetherian varieties
Binyamini, G. (2019) · Geometric and Functional Analysis · doi:10.1007/s00039-019-00475-7 · Cited by 15
Röbenack, K., & Voßwinkel, R. (2019) · International Conference on System Theory, Control and Computing (ICSTCC) · doi:10.1109/icstcc.2019.8885899 · Cited by 15
New Algorithms for Solving Zero-Sum Stochastic Games
Oliu‐Barton, M. (2020) · Mathematics of Operations Research · doi:10.1287/moor.2020.1055 · Cited by 15
Towards Traffic Bisimulation of Linear Periodic Event-Triggered Controllers
Gleizer, G. D. A., & Mazo, M. (2020) · IEEE Control Systems Letters · doi:10.1109/lcsys.2020.2999177 · Cited by 17
“(7) is a problem of checking non-emptiness of a semi-algebraic set, which has been proven to be decidable [15].”
BackgroundBounds for Polynomials on Algebraic Numbers and Application to Curve Topology
Diatta, D. N., Diatta, S., Rouillier, F., et al. (2022) · Discrete & Computational Geometry · doi:10.1007/s00454-021-00353-w · Cited by 15
Self-citationA 1–parameter family of spherical CR uniformizations of the figure eight knot complement
Deraux, M. (2016) · Geometry & Topology · doi:10.2140/gt.2016.20.3571 · Cited by 15
“11 4[5, 10], 7[3], 13[2, 5, 10], 17[9], 27[9, 18], 36[17, 28, 34] 5.”
BackgroundBürgisser, P., & Lotz, M. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0175-0 · Cited by 17
The econometrics of auctions with asymmetric anonymous bidders
Lamy, L. (2011) · Journal of Econometrics · doi:10.1016/j.jeconom.2011.10.007 · Cited by 15
“…is initialized by noting that F The right expressions in the system (4) are closely related to the coefficients of the expansion of the polynomial X From the Fundamental Theorem of Algebra [4], the factorization of a polynomial according to its roots among the complex number C exists and is unique.”
BackgroundInfluentialSymbolic computation of Drazin inverses by specializations
Sendra, J. R., Sendra, J., Sendra, J., et al. (2016) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2016.01.059 · Cited by 15
“So let K = C and let F = C (( z )) be the field of formal Laurent series in z with coefficients in C (see e.g. [2] pg. 65).”
BackgroundBasu, S. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0208-8 · Cited by 25
“For classical results in the field of real algebraic geometry, as well as the details of certain algorithms that we use, we refer the reader to [9] for convenience.”
BackgroundMethodResultInfluentialSelf-citationTheory-Specific Automated Reasoning
Formisano, A., & Omodeo, E. G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14309-0_3 · Cited by 16
The Complexity of the Hausdorff Distance
Jungeblut, P., Kleist, L., & Miltzow, T. (2023) · Discrete & Computational Geometry · doi:10.1007/s00454-023-00562-5 · Cited by 14
Matrix Isomorphism of Matrix Lie Algebras
Grochow, J. A. (2012) · Proceedings - IEEE Conference on Computational Complexity/Proceedings · doi:10.1109/ccc.2012.34 · Cited by 14
Vinzant, C. (2011) · Journal of Algebra · doi:10.1016/j.jalgebra.2011.11.028 · Cited by 13
“This can easily be checked using Sturm sequences [ BPR , x2.2.2].”
MethodInfluentialA formal study of Bernstein coefficients and polynomials
Bertot, Y., Guilhot, F., & Mahboubi, A. (2011) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000090 · Cited by 14
Parametrized homology via zigzag persistence
Carlsson, G., de Silva, V., Kališnik, S., & Morozov, D. (2019) · Algebraic & Geometric Topology · doi:10.2140/agt.2019.19.657 · Cited by 23
“In particular, this applies when X is semialgebraic [5].”
BackgroundHuang, Z., England, M., Davenport, J. H., & Paulson, L. C. (2016) · International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) · doi:10.1109/synasc.2016.020 · Cited by 29
“For some applications there exist algorithms with better complexity [3], but CAD implementations still remain the best general purpose approach for many.”
BackgroundG-Tutte Polynomials and Abelian Lie Group Arrangements
Liu, Y., Tran, T. N., & Yoshinaga, M. (2019) · International Mathematics Research Notices · doi:10.1093/imrn/rnz092 · Cited by 14
Automatic generation of bounds for polynomial systems with application to the Lorenz system
Röbenack, K., Voßwinkel, R., & Richter, H. (2018) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2018.05.012 · Cited by 14
Low-Dimensional Invariant Embeddings for Universal Geometric Learning
Dym, N., & Gortler, S. J. (2024) · Foundations of Computational Mathematics · doi:10.1007/s10208-024-09641-2 · Cited by 72
Parallel SMT-Based Parameter Synthesis with Application to Piecewise Multi-affine Systems
Beneš, N., Brim, L., Demko, M., Pastva, S., & Šafránek, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-46520-3_13 · Cited by 13
Deciding Univariate Polynomial Problems Using Untrusted Certificates in Isabelle/HOL
Li, W., Passmore, G. O., & Paulson, L. C. (2017) · Journal of Automated Reasoning · doi:10.1007/s10817-017-9424-6 · Cited by 13
Analytic expressions for the positive definite and unimodal regions of Gram-Charlier series
Kwon, O. K. (2020) · Communication in Statistics- Theory and Methods · doi:10.1080/03610926.2020.1833219 · Cited by 13
“Refer to Basu et al. (2006) Proposition 4.15. w So the determination of the boundaries of Rþ and Ru requires the solution of resðp, p0Þ ¼ 0 and resðq, q0Þ ¼ 0 respectively, where p and q are as defined in (1) and (2).”
MethodInfluentialQuantifier elimination for a class of exponential polynomial formulas
Xu, M., Li, Z., & Lu, Y. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.09.015 · Cited by 13
Proving inequalities and solving global optimization problems via simplified CAD projection
Han, J., Jin, Z. H., & Xia, B. (2015) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2015.02.007 · Cited by 17
“Algorithms of single exponential complexity to solve Problem 3 in the case of integer coefficients were given in (Grigor’ev et al., 1988; Renegar, 1992; Heintz et al., 1993; Basu et al., 1996, 2006).”
BackgroundAnalyticity of the Planar Limit of a Matrix Model
Garoufalidis, S., & Popescu, I. (2012) · Annales Henri Poincaré · doi:10.1007/s00023-012-0191-y · Cited by 12
Incidence Bounds for Complex Algebraic Curves on Cartesian Products
Solymosi, J., & de Zeeuw, F. (2018) · Bolyai Society mathematical studies · doi:10.1007/978-3-662-57413-3_16 · Cited by 13
On the Global-Local Dichotomy in Sparsity Modeling
Batenkov, D., Romano, Y., & Elad, M. (2017) · Applied and numerical harmonic analysis · doi:10.1007/978-3-319-69802-1_1 · Cited by 13
The complexity of Dominating Set in geometric intersection graphs
de Berg, M., Kisfaludi-Bak, ., & Woeginger, G. J. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.10.007 · Cited by 13
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Berthelsen, M. L. T., & Hansen, K. A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-30473-7_11 · Cited by 13
Optimal Control of Piece-Wise Polynomial Hybrid Systems Using Cylindrical Algebraic Decomposition
Fotiou, I. A., Beccuti, A. G., Papafotiou, G. A., & Morari, M. (2006) · Lecture notes in computer science · doi:10.1007/11730637_19 · Cited by 15
On the Stability of End-Point-Based Multimedia Streaming
Dán, G., Fodor, V., & Karlsson, G. (2006) · Lecture notes in computer science · doi:10.1007/11753810_57 · Cited by 15
The Smallest Multistationary Mass-Preserving Chemical Reaction Network
Shiu, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85101-1_13 · Cited by 13
“The parametrization is captured in Table 1 and can be computed “by hand,” but larger systems may require techniques of computational real algebraic geometry [1].”
MethodA nonparametric analysis of multi-product oligopolies
Carvajal, A., Deb, R. A., Fenske, J. E., et al. (2014) · Economic Theory · doi:10.1007/s00199-014-0843-x · Cited by 13
Basu, S., Ṗasechnik, D. V., & Roy, M.-F. (2010) · Journal of the European Mathematical Society · doi:10.4171/jems/208 · Cited by 13
Self-citationFaster p -adic feasibility for certain multivariate sparse polynomials
Avendano, M. E., Ibrahim, A. A., Rojas, J. M., et al. (2011) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2011.09.007 · Cited by 13
Incidences between points and lines in R4
Sharir, M., & Solomon, N. (2014) · doi:10.1145/2582112.2582147 · Cited by 12
Lösung regelungstechnischer Problemstellungen mittels Quantorenelimination
Röbenack, K., & Voßwinkel, R. (2019) · at - Automatisierungstechnik · doi:10.1515/auto-2019-0045 · Cited by 12
Solving parametric systems of polynomial equations over the reals through Hermite matrices
Le, H. P., & Din, M. S. E. (2021) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2021.12.002 · Cited by 12
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M. I., & Wakabayashi, Y. (2015) · Algorithmica · doi:10.1007/s00453-015-0052-4 · Cited by 17
“For an extensive list of algorithms for real algebraic geometry, see [7].”
Stickelberger and the Eigenvalue Theorem
Cox, D. A. (2021) · Springer eBooks · doi:10.1007/978-3-030-89694-2_8 · Cited by 18
“3) can be found in [2].”
Termination of Polynomial Loops
Frohn, F., Hark, M., & Giesl, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65474-0_5 · Cited by 15
“If the number of variables is bounded, then checking validity of an existential formula over the reals is in P (see [2]).”
BackgroundEstimating correlation under interval uncertainty
Jalal-Kamali, A., & Крейнович, В. (2013) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2012.12.003 · Cited by 12
A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities
Basu, S., & Kettner, M. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-9001-6 · Cited by 12
Self-citationComputing with semi-algebraic sets: Relaxation techniques and effective boundaries
Chen, C., Davenport, J. H., Maza, M. M., Xia, B., & Xiao, R. (2012) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2012.05.013 · Cited by 16
“We refer to [16] for more advanced notions in general topology and to [2] for topological questions related to real algebraic geometry, such as Sard's Theorem.”
BackgroundSub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Bi, J., Cheng, Q., & Rojas, J. M. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465514 · Cited by 12
“1, pp. 397–402], [RS02, pg. 9], and [BPR06, Thm. 4.16, pg. 107] for a more modern treatment.”
InfluentialDetecting level crossings without solving the Hamiltonian. II. Applications to atoms and molecules
Bhattacharya, M., & Raman, C. (2007) · Physical Review A · doi:10.1103/physreva.75.033406 · Cited by 12
Exact arrangements on tori and Dupin cyclides
Berberich, E., & Kerber, M. (2008) · ACM Symposium on Solid and Physical Modeling (SPM) · doi:10.1145/1364901.1364912 · Cited by 12
“By the Cauchy bound [Basu et al. 2006, Lemma 10.2], the absolute value of each real root of ..”
BackgroundInfluentialOn the Need of Neuromorphic Twins to Detect Denial-of-Service Attacks on Communication Networks
Boche, H., Schaefer, R. F., Poor, H. V., & Fitzek, F. H. P. (2024) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2024.3369018 · Cited by 11
Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces
Bank, B., Giusti, M., Heintz, J., Lehmann, L., & Pardo, L. M. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9112-6 · Cited by 9
The dimension of semialgebraic subdifferential graphs
Drusvyatskiy, D., Ioffe, A. D., & Lewis, A. S. (2011) · Nonlinear Analysis · doi:10.1016/j.na.2011.07.040 · Cited by 11
Parameterization of a Set Determined by the Generalized Discriminant of a Polynomial
Batkhin, A. B. (2018) · Programming and Computer Software · doi:10.1134/s0361768818020032 · Cited by 11
Input-to-State Stability Mapping for Nonlinear Control Systems Using Quantifier Elimination
Voßwinkel, R., Röbenack, K., & Bajçinca, N. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550228 · Cited by 11
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Berthelsen, M. L. T., & Hansen, K. A. (2022) · Theory of Computing Systems · doi:10.1007/s00224-022-10080-1 · Cited by 11
Computing critical points for invariant algebraic systems
Faugère, J., Labahn, G., Din, M. S. E., et al. (2022) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2022.10.002 · Cited by 11
Real Number Signal Processing can Detect Denial-of-Service Attacks
Boche, H., Schaefer, R. F., & Poor, H. V. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413911 · Cited by 11
Geometry of Linear Convolutional Networks
Kohn, K., Merkh, T., Montúfar, G., & Trager, M. (2022) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/21m1441183 · Cited by 44
Counting joints with multiplicities
Iliopoulou, M. (2012) · Proceedings of the London Mathematical Society · doi:10.1112/plms/pds052 · Cited by 10
On real one-sided ideals in a free algebra
Cimprič, J., Helton, J. W., Klep, I., McCullough, S., & Nelson, C. (2013) · Journal of Pure and Applied Algebra · doi:10.1016/j.jpaa.2013.05.012 · Cited by 10
Evaluating Winding Numbers and Counting Complex Roots Through Cauchy Indices in Isabelle/HOL
Li, W., & Paulson, L. C. (2019) · Journal of Automated Reasoning · doi:10.1007/s10817-019-09521-3 · Cited by 11
On the Complexity of Computing Real Radicals of Polynomial Systems
Din, M. S. E., Yang, Z., & Zhi, L. (2018) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3208976.3209002 · Cited by 11
“Using [1, Chapter 14], this can be done using δ O ( max ( 1 , r )) arithmetic operations in Q .”
MethodNew Trends in Intuitive Geometry
Ambrus, G., Bárány, I., BöröczkyJr., K., et al. (2018) · Bolyai Society mathematical studies · doi:10.1007/978-3-662-57413-3 · Cited by 11
Improved bounds for the Kakeya maximal conjecture in higher dimensions
Hickman, J., Rogers, K. M., & Zhang, R. (2022) · American Journal of Mathematics · doi:10.1353/ajm.2022.0037 · Cited by 21
“A useful reference for this material is [1].”
BackgroundOn the Wolff circular maximal function
Zahl, J. (2012) · Illinois Journal of Mathematics · doi:10.1215/ijm/1399395832 · Cited by 21
“See, for example, [3], [4] for additional information.”
Detecting level crossings without solving the Hamiltonian. I. Mathematical background
Bhattacharya, M., & Raman, C. (2007) · Physical Review A · doi:10.1103/physreva.75.033405 · Cited by 11
Dipole oscillations in fermionic mixtures
Chiacchiera, S., Macrì, T., & Trombettoni, A. (2010) · Physical Review A · doi:10.1103/physreva.81.033624 · Cited by 11
On a real analog of Bezout inequality and the number of connected components of sign conditions
Barone, S., & Basu, S. (2016) · Proceedings of the London Mathematical Society · doi:10.1112/plms/pdv059 · Cited by 18
Self-citationOn Solving Parametric Polynomial Systems
Maza, M. M., Xia, B., & Xiao, R. (2012) · Mathematics in Computer Science · doi:10.1007/s11786-012-0136-3 · Cited by 11
Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics
Mulligan, C. B., Bradford, R., Davenport, J. H., England, M., & Tonks, Z. (2018) · National Bureau of Economic Research · doi:10.3386/w24602 · Cited by 13
“It is worth noting that examples with this number of variables would rarely appear in the QE literature, since many QE algorithms have complexity doubly exponential in the number of variables [15], [16], with QE itself doubly exponential in the number of quantifier changes [2].”
BackgroundThe Complexity of Reasoning with Relative Directions
Hee, L. J. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-507 · Cited by 10
Salzman, O., Hemmer, M., & Halperin, D. (2013) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-36279-8_19 · Cited by 10
Fixed order LPV controller design for LPV models in input-output form
Cerone, V., Piga, D., Regruto, D., et al. (2012) · doi:10.1109/cdc.2012.6426281 · Cited by 10
“By exploiting a generalization of Descartes’ rule ([14]), it is possible to apply the so-called scalarization approach proposed in [15], which allows us to replace the PMI constraints J (θ, λi , P ) 0, ∀i = 1, 2, .”
MethodVandermonde Varieties, Mirrored Spaces, and the Cohomology of Symmetric Semi-algebraic Sets
Basu, S., & Riener, C. (2021) · Foundations of Computational Mathematics · doi:10.1007/s10208-021-09519-7 · Cited by 10
Self-citationIdentifiability of directed Gaussian graphical models with one latent source
Leung, D., Drton, M., & Hara, H. (2016) · Electronic Journal of Statistics · doi:10.1214/16-ejs1111 · Cited by 19
“By Sard’s theorem (Basu et al., 2006, p. 192), f(C), and thus also f(C), has dimension less than n.”
BackgroundCAD and Topology of Semi-Algebraic Sets
Lazard, D. (2010) · Mathematics in Computer Science · doi:10.1007/s11786-010-0047-0 · Cited by 11
Two conjectures on the arithmetic in ℝ and ℂ
Tyszka, A. (2010) · Mathematical logic quarterly · doi:10.1002/malq.200910004 · Cited by 10
Solving parametric piecewise polynomial systems
Lai, Y., Wang, R.-H., & Wu, J. (2011) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2011.05.008 · Cited by 10
Grosu, C. (2014) · Journal of the London Mathematical Society · doi:10.1112/jlms/jdu007 · Cited by 17
Smoothing the Gap Between NP and ER
Erickson, J., van der Hoog, I., & Miltzow, T. (2022) · SIAM Journal on Computing · doi:10.1137/20m1385287 · Cited by 50
Tools for analyzing the intersection curve between two quadrics through projection and lifting
González-Vega, L., & Trocado, A. E. B. D. S. (2021) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113522 · Cited by 10
Survey of Eight Modern Methods of Hamiltonian Mechanics
Bruno, A. D., & Batkhin, A. B. (2021) · Axioms · doi:10.3390/axioms10040293 · Cited by 10
Computing isolated roots of sparse polynomial systems in affine space
Herrero, M. I., Jeronimo, G., & Sabia, J. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.07.015 · Cited by 8
Computing the dimension of a semi-algebraic set
Basu, S., Pollack, R. M., & Roy, M.-F. (2006) · Journal of Mathematical Sciences · doi:10.1007/s10958-006-0111-0 · Cited by 11
Self-citation$L^3$ estimates for an algebraic variable coefficient Wolff circular maximal function
Zahl, J. (2012) · Revista Matemática Iberoamericana · doi:10.4171/rmi/703 · Cited by 10
“Further details on the material reviewed below can be found in [3], [2], and [9] (see [11] for an English summary of the key results we need from [9]).”
BackgroundA direct method for checking overlap of two hyperellipsoids
Gilitschenski, I., & Hanebeck, U. D. (2014) · Sensor Data Fusion: Trends, Solutions, Applications (SDF) · doi:10.1109/sdf.2014.6954724 · Cited by 10
“Second, the fact that K(λ) is a polynomial makes a direct evaluation of the presented condition possible, because Sturm’s theorem [15], [16] can be applied.”
BackgroundDesign of Marx generators as a structured eigenvalue assignment
Galeani, S., Henrion, D., Jacquemard, A., & Zaccarian, L. (2014) · Automatica · doi:10.1016/j.automatica.2014.09.003 · Cited by 11
A Complex Analogue of Toda’s Theorem
Basu, S. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9105-5 · Cited by 10
Self-citationMotion Planning via Manifold Samples
Salzman, O., Hemmer, M., Raveh, B., & Halperin, D. (2013) · Algorithmica · doi:10.1007/s00453-012-9736-1 · Cited by 26
Algebraic Boundaries of $$\mathrm{SO}(2)$$ SO ( 2 ) -Orbitopes
Sinn, R. (2013) · Discrete & Computational Geometry · doi:10.1007/s00454-013-9501-5 · Cited by 9
Separating linear forms for bivariate systems
Bouzidi, Y., Lazard, S., Pouget, M., et al. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465518 · Cited by 9
On the Uniqueness Problem for Quadrature Domains
Ameur, Y., Helmer, M., & Tellander, F. (2021) · Computational Methods and Function Theory · doi:10.1007/s40315-021-00373-w · Cited by 9
On Classifying Continuous Constraint Satisfaction Problems
Miltzow, T., & Schmiermann, R. F. (2024) · TheoretiCS · doi:10.46298/theoretics.24.10 · Cited by 9
“Note that S is typically semi-algebraic for an algebraic geometer [8], but typically not for a computer scientist [42].”
BackgroundRasetti, M., & Merelli, E. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/626/1/012005 · Cited by 9
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Liang, S., & Jeffrey, D. J. (2006) · Lecture notes in computer science · doi:10.1007/11856290_12 · Cited by 11
A modular, efficient formalisation of real algebraic numbers
Li, W., & Paulson, L. C. (2016) · doi:10.1145/2854065.2854074 · Cited by 9
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers
Borralleras, C., Larraz, D., Rodríguez-Carbonell, E., Oliveras, A., & Rubio, A. (2019) · ACM Transactions on Computational Logic · doi:10.1145/3340923 · Cited by 16
Model checking QCTL plus on quantum Markov chains
Xu, M., Fu, J., Mei, J., & Deng, Y. (2022) · Theoretical Computer Science · doi:10.1016/j.tcs.2022.01.044 · Cited by 9
Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
Bank, B., Giusti, M., & Heintz, J. (2013) · Mathematics of Computation · doi:10.1090/s0025-5718-2013-02766-4 · Cited by 9
Dynamic Newton–Puiseux theorem
Mannaa, B., & Coquand, T. (2013) · Journal of Logic and Analysis · doi:10.4115/jla.2013.5.5 · Cited by 9
Metric Properties of Semialgebraic Mappings
Kurdyka, K., Spodzieja, S., & Szlachcińska, A. (2016) · Discrete & Computational Geometry · doi:10.1007/s00454-016-9776-4 · Cited by 10
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.