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 301–400 of 865
Subquadratic Algorithms for Algebraic 3SUM
Barba, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2018) · Discrete & Computational Geometry · doi:10.1007/s00454-018-0040-y · Cited by 17
Topologies of Random Geometric Complexes on Riemannian Manifolds in the Thermodynamic Limit
Auffinger, A., Lerario, A., & Lundberg, E. (2020) · International Mathematics Research Notices · doi:10.1093/imrn/rnaa050 · Cited by 10
肖, 水., & 曾, 广. (2010) · Scientia Sinica Mathematica · doi:10.1360/012010-251 · Cited by 9
Univariate real root isolation in an extension field and applications
Strzeboński, A., & Tsigaridas, E. (2018) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2017.12.001 · Cited by 9
Isolating real roots of real polynomials
Mehlhorn, K., & Sagraloff, M. (2009) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1576702.1576737 · Cited by 9
Division-free computation of subresultants using Bezout matrices
Kerber, M. (2009) · International Journal of Computer Mathematics · doi:10.1080/00207160802460595 · Cited by 9
“The usual computation strategy for the subresultants is to iteratively perform pseudo-division, but scalar factors are divided out in each iteration to prevent a too big swell-up of the coefficient size.”
Reasoning About States of Probabilistic Sequential Programs
Chadha, R., Mateus, P., & Sernadas, A. (2006) · Lecture notes in computer science · doi:10.1007/11874683_16 · Cited by 9
Complexity of real root isolation using continued fractions
Sharma, V. (2007) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1277548.1277594 · Cited by 9
Competitive Equilibria in Semi-Algebraic EconomiesPreprint
Kübler, F., & Schmedders, K. H. (2007) · SSRN Electronic Journal · doi:10.2139/ssrn.976890 · Cited by 9
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
Abrahamsen, M., Miltzow, T., & Seiferth, N. (2024) · TheoretiCS · doi:10.46298/theoretics.24.11 · Cited by 8
Termination of triangular polynomial loops
Hark, M., Frohn, F., & Giesl, J. (2023) · Formal Methods in System Design · doi:10.1007/s10703-023-00440-z · Cited by 26
“With these restrictions, the method SMT has polynomial runtime (see [2, 41]).”
BackgroundMethodBraiding topology of symmetry-protected degeneracy points in non-Hermitian systems
Li, J.-Z., Bai, K., Guo, C., Liu, T.-R., Fang, L., Wan, D., & Xiao, M. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.l041102 · Cited by 10
Algebraic cycles from a computational point of view
Simpson, C. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.10.008 · Cited by 7
“The topology of such a variety may be computed algorithmically, either by triangulating [2] or by a point-cloud method [47] as we shall discuss in Section 2.”
BackgroundMethodInfluentialKheradmand, E., Laforest, M., & Prudhomme, S. (2022) · Computational Particle Mechanics · doi:10.1007/s40571-022-00460-2 · Cited by 8
Melczer, S., & Salvy, B. (2020) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2020.01.001 · Cited by 11
Separately Nash and arc‐Nash functions over real closed fields
Kucharz, W., Kurdyka, K., & El‐Siblani, A. (2020) · Bulletin of the London Mathematical Society · doi:10.1112/blms.12432 · Cited by 8
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Banerjee, B., & Chandrasekaran, B. (2013) · Cited by 8
Tournament Quasirandomness from Local Counting
Bucić, M., Long, E., Shapira, A., et al. (2021) · COMBINATORICA · doi:10.1007/s00493-020-4371-y · Cited by 8
On generalizing Descartes' rule of signs to hypersurfaces
Feliu, E., & Telek, M. L. (2022) · Advances in Mathematics · doi:10.1016/j.aim.2022.108582 · Cited by 8
Completeness for the Complexity Class $$\forall \exists \mathbb {R}$$ and Area-Universality
Dobbins, M. G., Kleist, L., Miltzow, T., et al. (2022) · Discrete & Computational Geometry · doi:10.1007/s00454-022-00381-0 · Cited by 8
“For all we know, all these complexity classes could collapse, as it is open whether NP and PSPACE constitute two different or the same complexity class, see Fig.”
BackgroundInfluentialTopological descriptors of the parameter region of multistationarity: Deciding upon connectivity
Telek, M. L., & Feliu, E. (2023) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1010970 · Cited by 18
Representing simple d-dimensional polytopes by d polynomials
Averkov, G., & Henk, M. (2009) · Mathematical Programming · doi:10.1007/s10107-009-0280-y · Cited by 8
Input-output LPV model identification with guaranteed quadratic stability
Cerone, V., Piga, D., Regruto, D., et al. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120711-3-be-2027.00242 · Cited by 8
“By exploiting the generalization of the Descartes’ rule (Basu et al. (2006)), it is possible to apply to (26) and (27) the socalled scalarization approach, proposed in Lasserre (2005), which allows to exactly replace the PMI constraints c a(λi )+ a(λi ) c − F (P ) 0, ∀i = 1, 2, .”
A Complexity Theory of Constructible Functions and Sheaves
Basu, S. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9222-z · Cited by 8
Self-citationOn the intrinsic complexity of point finding in real singular hypersurfaces
Bank, B., Giusti, M., Heintz, J., et al. (2009) · Information Processing Letters · doi:10.1016/j.ipl.2009.07.014 · Cited by 8
“There is no place here to discuss this subject and we refer the reader to [7].”
BackgroundImproved algorithm for computing separating linear forms for bivariate systems
Bouzidi, Y., Lazard, S., Moroz, G., et al. (2014) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608668 · Cited by 8
Wang, J. (2016) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2016.03.007 · Cited by 8
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location
Ezra, E. E., Har-Peled, S., Kaplan, H. Y., et al. (2019) · Discrete & Computational Geometry · doi:10.1007/s00454-019-00141-7 · Cited by 8
Stabilization by Static Output Feedback: A Quantifier Elimination Approach
Röbenack, K., Voswinkel, R., Franke, M., et al. (2018) · International Conference on System Theory, Control and Computing (ICSTCC) · doi:10.1109/icstcc.2018.8540735 · Cited by 8
Computing real radicals and S-radicals of polynomial systems
Din, M. S. E., Yang, Z., & Zhi, L. (2019) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2019.10.018 · Cited by 8
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game
Etessami, K. (2020) · Games and Economic Behavior · doi:10.1016/j.geb.2019.03.006 · Cited by 8
“Note that we specifically refer to theorems and page numbers of the online edition [4]; these are in general different from the printed edition [3].”
BackgroundMethodInfluentialA note on the univariate nonic derived from the coupler curve of four-bar linkages
Bai, S. (2021) · Mechanism and Machine Theory · doi:10.1016/j.mechmachtheory.2021.104344 · Cited by 8
Polynomial-Time Presentations of Algebraic Number Fields
Alaev, P. E., & Selivanov, V. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-94418-0_2 · Cited by 9
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
Grigoriev, D. Y., Iosif, A., Rahkooy, H., Sturm, T., & Weber, A. (2019) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.1007/s11786-020-00479-9 · Cited by 10
Disguised toric dynamical systems
Moncusí, L. B. I., Crăciun, G., & Sorea, M. (2022) · Journal of Pure and Applied Algebra · doi:10.1016/j.jpaa.2022.107035 · Cited by 12
Gerwien, M., Voßwinkel, R., & Richter, H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00447-5 · Cited by 7
On s-confining SUSY-QCD with anomaly mediation
de Lima, C. H., & Stolarski, D. (2023) · Journal of High Energy Physics · doi:10.1007/jhep10(2023)020 · Cited by 10
Invariant-Based Characterization of the Relative Position of Two Projective Conics
Petitjean, S. (2009) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4419-0999-2_8 · Cited by 7
Algebraic analysis of kinematics of multibody systems
Piipponen, S., & Tuomela, J. (2013) · Mechanical sciences · doi:10.5194/ms-4-33-2013 · Cited by 7
Real root finding for low rank linear matrices
Henrion, D., Naldi, S., & Din, M. S. E. (2019) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-019-00396-w · Cited by 9
Tropical Combinatorial Nullstellensatz and Sparse Polynomials
Grigoriev, D. Y., & Podolskii, V. V. (2019) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09431-1 · Cited by 9
“, [5]) and the dimension does not increase after the projection.”
BackgroundOn the sensitivity of the optimal partition for parametric second-order conic optimization
Mohammad-Nezhad, A., & Terlaky, T. (2021) · Mathematical Programming · doi:10.1007/s10107-021-01690-7 · Cited by 7
Complexity of optimizing over the integers
Basu, A. (2022) · Mathematical Programming · doi:10.1007/s10107-022-01862-z · Cited by 7
“For example, with no integer variables we enter the realm of real algebraic geometry or the existential theory of reals where the problem is decidable; see [15] with references to a rich literature.”
BackgroundYadav, P. K., & Karuppaiah, P. (2023) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-023-02262-9 · Cited by 7
“We state the following result to use later from (page 169, [1]).”
BackgroundCore Hybrid Event-B III: Fundamentals of a reasoning framework
Banach, R. (2023) · Science of Computer Programming · doi:10.1016/j.scico.2023.103002 · Cited by 7
Symbolic optimization of algebraic functions
Kanno, M., Yokoyama, K., Anai, H., & Hara, S. (2008) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1390768.1390791 · Cited by 7
González-Vega, L., & Rúa, I. F. (2009) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2009.07.003 · Cited by 7
Approximating functions on stratified sets
Drusvyatskiy, D., & Larsson, M. (2014) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-2014-06412-x · Cited by 7
“For more details on semi-algebraic geometry, see for example [3, 5].”
BackgroundAnalyzing Qualitative Spatio-Temporal Calculi using Algebraic Geometry
Wolter, D. (2012) · Spatial Cognition and Computation · doi:10.1080/13875868.2011.586079 · Cited by 7
“The problem of computing real-valued solutions has been intensively studied in mathematics and meth-ods have been developed (see Basu et al., 2006).”
BackgroundMethodHomogeneous selections from hyperplanes
Bárány, I., & Pach, J. (2013) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2013.10.001 · Cited by 7
“Note that semi-algebraic sets can also be defined using quantifiers involving additional variables, but these quantifiers can always be eliminated (see [3]).”
BackgroundBlock LU factorization of Hankel and Bezout matrices and Euclidean algorithm
Diaz–Toca, G. M., & Atti, N. B. (2008) · International Journal of Computer Mathematics · doi:10.1080/00207160802322340 · Cited by 7
“Onthe other hand, there are other interesting applications related in the area of real algebraic geometry, such as the computation of the number of real roots of a real polynomial or the Routh– Hurwitz problem for real polynomials (see [1,12]).”
BackgroundMethodTowards semantic mathematical editing
van der Hoeven, J. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.09.040 · Cited by 7
Semi-algebraic sets and equilibria of binary games
Vigeral, G., & Viossat, Y. (2015) · Operations Research Letters · doi:10.1016/j.orl.2015.11.002 · Cited by 7
Multi-degree Bounds on the Betti Numbers of Real Varieties and Semi-algebraic Sets and Applications
Basu, S., & Rizzie, A. C. (2017) · Discrete & Computational Geometry · doi:10.1007/s00454-017-9944-1 · Cited by 7
Self-citationEntropies for radially symmetric higher-order nonlinear diffusion equations
Bukal, M., Jüngel, A., & Matthes, D. (2011) · Communications in Mathematical Sciences · doi:10.4310/cms.2011.v9.n2.a2 · Cited by 8
The Capacity of Quiver Representations and Brascamp–Lieb Constants
Chindris, C., & Derksen, H. (2021) · International Mathematics Research Notices · doi:10.1093/imrn/rnab064 · Cited by 7
INCIDENCE BOUNDS ON MULTIJOINTS AND GENERIC JOINTS
Iliopoulou, M. (2015) · Kent Academic Repository (University of Kent) · Cited by 7
Labbé, M., Plein, F., Schmidt, M., et al. (2021) · Networks · doi:10.1002/net.22003 · Cited by 7
“16 in [5] are also bounded by O(log |V|+τ).”
BackgroundInfluentialFaster One Block Quantifier Elimination for Regular Polynomial Systems of Equations
Le, H. P., & Din, M. S. E. (2021) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3452143.3465546 · Cited by 7
“For one-block quantifier elimination, the arithmetic complexity and the degree of polynomials in the output of these algorithms are of order s n +1 D O ( nt ) where D is the bound on the degree of input polynomials (see [4, Algo 14.6]).”
BackgroundMethodResultInfluentialHitting Sets for Orbits of Circuit Classes and Polynomial Families
Saha, C., & Thankey, B. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx/random.2021.50 · Cited by 7
Resolution-Exact Algorithms for Link Robots
Luo, Z., Chiang, Y., Lien, J., & Yap, C. K. (2015) · Springer tracts in advanced robotics · doi:10.1007/978-3-319-16595-0_21 · Cited by 10
“The exact approaches have been developed by Computational Geometers [6] and in computer algebra [2].”
MethodOptimization and NP_R-completeness of certain fewnomials
Pébaÿ, P., Rojas, J. M., & Thompson, D. (2009) · doi:10.1145/1577190.1577212 · Cited by 7
Optimal evolution models for quantum tomography
Czerwiński, A. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/7/075301 · Cited by 8
On projections of semi-algebraic sets defined by few quadratic inequalitiesPreprint
Basu, S., & Zell, T. (2008) · Cited by 7
Self-citationComplexity, exactness, and rationality in polynomial optimization
Bienstock, D., Pia, A. D., & Hildebrand, R. (2022) · Mathematical Programming · doi:10.1007/s10107-022-01818-3 · Cited by 6
A dichotomy for Hörmander-type oscillatory integral operators
Guo, S., Wang, H., & Zhang, R. (2024) · Inventiones mathematicae · doi:10.1007/s00222-024-01288-8 · Cited by 6
Basu, S., & Riener, C. (2018) · International Mathematics Research Notices · doi:10.1093/imrn/rny062 · Cited by 6
Self-citationRamsey-type results for semi-algebraic relations
Conlon, D., Fox, J., Pach, J., et al. (2013) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2462356.2462399 · Cited by 6
“The last lemma on our list is an old theorem due to Sturm (see [4]).”
A census of zeta functions of quartic K surfaces over
Kedlaya, K. S., & Sutherland, A. V. (2016) · LMS Journal of Computation and Mathematics · doi:10.1112/s1461157016000140 · Cited by 6
Reflection groups, reflection arrangements, and invariant real varieties
Friedl, T., Riener, C., & Sanyal, R. (2017) · Proceedings of the American Mathematical Society · doi:10.1090/proc/13821 · Cited by 6
“In contrast to working over an algebraically closed field, the question ifX 6= ∅ is considerably more difficult to answer, both theoretically and in practice; see [3].”
BackgroundGlobal Optimization of Polynomials over Real Algebraic Sets
Wang, C., Yang, Z., & Zhi, L. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-8351-5 · Cited by 6
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
Hauenstein, J. D., Mohammad-Nezhad, A., Tang, T., et al. (2022) · Mathematics of Operations Research · doi:10.1287/moor.2021.1234 · Cited by 6
“where (15) is a basic constructible set [5] in C.”
BackgroundTask and Motion Planning Is PSPACE-Complete
Vega-Brown, W., & Roy, N. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i06.6607 · Cited by 6
“Furthermore, we can enumerate these cells using only polynomial space (Basu, Pollack, and Roy 2016).”
MethodChablat, D., Prébet, R., Din, M. S. E., Salunkhe, D. H., & Wenger, P. (2022) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3476446.3535477 · Cited by 9
“When the input polynomials have degree at most D, this can be done in time singly exponential in n and polynomial in D and s using the critical point method introduced in [20] and developed in [27, 2, 25].”
MethodThe Complexity of Envy-Free Graph Cutting
Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2022) · Artificial Intelligence · doi:10.1016/j.artint.2026.104585 · Cited by 11
Solution of algebraic riccati equations using the sum of roots
Kanno, M., Yokoyama, K., Anai, H., et al. (2009) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1576702.1576733 · Cited by 6
Linear solving for sign determination
Perrucci, D. (2011) · Theoretical Computer Science · doi:10.1016/j.tcs.2011.05.006 · Cited by 6
The landscape of G-structures in eight-manifold compactifications of M-theory
Babalic, E. M., & Lazaroiu, C. I. (2015) · Journal of High Energy Physics · doi:10.1007/jhep11(2015)007 · Cited by 9
“We mention that powerful algorithms exist [32] for the study of semi-algebraic sets.”
BackgroundKoiran, P., Portier, N., & Tavenas, S. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9642-1 · Cited by 12
On the Topology and Visualization of Plane Algebraic Curves
Jin, K., Cheng, J.-S., & Gao, X.-S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24021-3_19 · Cited by 6
BUKH, B., & Hubard, A. (2012) · Combinatorics Probability Computing · doi:10.1017/s096354831100040x · Cited by 6
Bouzidi, Y., Poteaux, A., & Quadrat, A. (2016) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2016.07.528 · Cited by 6
Semi-algebraic sets of f-vectors
Sjöberg, H., & Ziegler, G. M. (2019) · Israel Journal of Mathematics · doi:10.1007/s11856-019-1888-0 · Cited by 6
“In the following, we refer to Basu, Pollack and Roy [3] for notation and information about semi-algebraic sets.”
BackgroundMethodInfluentialA fraction-free unit-circle zero location test for a polynomial with any singularity profile
Lifshitz, A., & Bistritz, Y. (2018) · Linear and Multilinear Algebra · doi:10.1080/03081087.2018.1455802 · Cited by 6
Didactical Issues at the Interface of Mathematics and Computer Science
Durand-Guerrier, V., Meyer, A., & Modeste, S. (2019) · Mathematics education in the digital era · doi:10.1007/978-3-030-28483-1_6 · Cited by 7
“…theorem or Kepler’s conjecture (e.g. Borwein, 2012), the value of the results by questioning the place of constructive proofs and algorithms (e.g. Basu et al, 2006), and their methods, in particular concerning the experimental dimension of mathematics (e.g. Perrin, 2007; Borwein, 2012;…”
MethodMultistationarity and Bistability for Fewnomial Chemical Reaction Networks
Feliu, E., & Helmer, M. (2018) · Bulletin of Mathematical Biology · doi:10.1007/s11538-018-00555-z · Cited by 8
A local maximizer for lattice width of 3-dimensional hollow bodies
Averkov, G., Codenotti, G., Macchia, A., et al. (2021) · Discrete Applied Mathematics · doi:10.1016/j.dam.2021.04.009 · Cited by 6
Zero Counting and Invariant Sets of Differential Equations
Binyamini, G. (2017) · International Mathematics Research Notices · doi:10.1093/imrn/rnx199 · Cited by 6
Smooth points on semi-algebraic sets
Harris, K., Hauenstein, J. D., & Szántó, Á. (2022) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2022.09.003 · Cited by 11
“The current state of the art deterministic symbolic algorithm is given in (Basu et al., 2006a, Alg.”
InfluentialSadeghimanesh, A., & England, M. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04921-6 · Cited by 5
“R(k)[x] )m and A and B are semi-algebraic sets there are a variety of tools which can be employed, see for example [22].”
Decision problems for linear recurrences involving arbitrary real numbers
Neumann, E. (2021) · Logical Methods in Computer Science · doi:10.46298/lmcs-17(3:16)2021 · Cited by 6
Measuring the constrained reachability in quantum Markov chains
Xu, M., Huang, C.-C., & Feng, Y. (2020) · Acta Informatica · doi:10.1007/s00236-020-00392-5 · Cited by 7
(Short) Survey of Real Hypercomputation
Ziegler, M. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73001-9_86 · Cited by 6
Advice Coins for Classical and Quantum Computation
Aaronson, S., & Drucker, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22006-7_6 · Cited by 6
Jeronimo, G., & Perrucci, D. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9619-0 · Cited by 6
On the computation of the topology of plane curves
Diatta, D. N., Rouillier, F., & Roy, M.-F. (2014) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608670 · Cited by 6
“The definition of the subresultant polynomials can be found, for example, in [5].”
InfluentialSelf-citationWu, W., Chen, C., & Reid, G. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-66320-3_27 · Cited by 8
“Computational real algebraic geometry is the study of the global structure of real solution sets of polynomial systems, including positive dimensional solution components (see [2] for a background text on algorithms for exact real algebraic geometry).”
BackgroundPolynomial bivariate copulas of degree five: characterization and some particular inequalities
Šeliga, A., Kauers, M., Saminger‐Platz, S., Mesiar, R., Kolesárová, A., & Klement, E. P. (2021) · Dependence Modeling · doi:10.1515/demo-2021-0101 · Cited by 7
Exact algorithms for semidefinite programs with degenerate feasible set
Henrion, D., Naldi, S., & Din, M. S. E. (2018) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 6
Automated Economic Reasoning with Quantifier Elimination
Mulligan, C. B. (2016) · National Bureau of Economic Research · doi:10.3386/w22922 · Cited by 6
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.