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 101–200 of 865
Exponentially more concise quantum recognition of non-RMM regular languages
Qiu, D., Li, L., Mateus, P., & Sernadas, A. (2014) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2014.06.008 · Cited by 30
Highly symmetric POVMs and their informational power
Słomczyński, W., & Szymusiak, A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1157-z · Cited by 35
On Searching for Small Kochen-Specker Vector Systems
Arends, F., Ouaknine, J., & Wampler, C. W. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25870-1_4 · Cited by 37
“For an in-depth account of relevant algorithms and results in this area, we refer the reader to [4].”
BackgroundFinding points on real solution components and applications to differential polynomial systems
Wu, W., & Reid, G. J. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465954 · Cited by 26
Geometric optimization and sums of algebraic functions
Vigneron, A. (2014) · ACM Transactions on Algorithms · doi:10.1145/2532647 · Cited by 26
“We will also use a related result of Basu, Pollack and Roy [9, Algorithm 14.9], which allows to minimize or maximize a nice function over a semi-algebraic sets.”
MethodInfluentialHomoclinic points, atoral polynomials, and periodic points of algebraic -actions
Lind, D., Schmidt, K. H., & Verbitskiy, E. A. (2012) · Ergodic Theory and Dynamical Systems · doi:10.1017/s014338571200017x · Cited by 26
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
Magron, V., Din, M. S. E., & Schweighofer, M. (2018) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2018.06.005 · Cited by 32
Multiple solutions to the likelihood equations in the Behrens–Fisher problem
Drton, M. (2008) · Statistics & Probability Letters · doi:10.1016/j.spl.2008.06.012 · Cited by 25
“If ∆ = 0, then f may have one real root of multiplicity three or two distinct real roots of which one has multiplicity two. These and more general results on discriminants can be found for example in Basu et al. (2003, §4.1-2). The coefficients a0, a1 and a2 of f in (2.4) are random variables with a continuous distribut…”
BackgroundInfluentialAnderson localization for two interacting quasiperiodic particles
Bourgain, J., & Kachkovskiy, I. (2019) · Geometric and Functional Analysis · doi:10.1007/s00039-019-00478-4 · Cited by 22
Platzer, A. (2017) · ACM Transactions on Computational Logic · doi:10.1145/3091123 · Cited by 30
“(1) The preimage f −1 (A) of any semialgebraic set A under a semialgebraic function f is semialgebraic (Basu et al. 2006, Proposition 2.83), thus, Borel measurable.”
BackgroundInfluentialErdős–Szekeres-type statements: Ramsey function and decidability in dimension 1
Bukh, B., & Matoušek, J. (2014) · Duke Mathematical Journal · doi:10.1215/00127094-2785915 · Cited by 27
“^ ˆ2G ˆ(X;Y) H : We would like to test the validity of using a decision algorithm for the rst-order theory of real-closed elds (the rst such algorithm is due to Tarski [18], and we refer, e.g., to [2] to more recent ones). While ( L;H) can easily be rewritten to a rst-order formula in the theory of the reals (since sg…”
MethodA Survey of Satisfiability Modulo Theory
Monniaux, D. P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45641-6_26 · Cited by 58
“Current approaches in SMT [38] are based on partial cylindrical algebraic decomposition [14]; possibly methods based on critical points [5, 29, 62] could be investigated as well.”
Algebraic Methods for Multiobjective Optimal Design of Control Feedbacks for Linear Systems
Menini, L., Possieri, C., & Tornambè, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2800784 · Cited by 26
Under-approximate flowpipes for non-linear continuous systems
Rwth, X. C., Sankaranarayanan, S., & Ábrahám, E. (2014) · Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2014.6987596 · Cited by 25
Computer algebra methods for testing the structural stability of multidimensional systems
Bouzidi, Y., Quadrat, A., & Rouillier, F. (2015) · doi:10.1109/nds.2015.7332633 · Cited by 24
Numerical algebraic geometry for model selection and its application to the life sciences
Gross, E. L., Davis, B., Ho, K. L., Bates, D. J., & Harrington, H. A. (2016) · Journal of The Royal Society Interface · doi:10.1098/rsif.2016.0256 · Cited by 26
Efficient Multiplication of Polynomials on Graphics Hardware
Emeliyanenko, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03644-6_11 · Cited by 24
Certificates of Positivity in the Bernstein Basis
Boudaoud, F., Caruso, F., & Roy, M.-F. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-9042-x · Cited by 25
“The algorithm decides first whether P has a root on [−1, 1] and if it is not the case proceeds by dichotomy, in a way similar to the Real Root Isolation Algorithm (see [ 1 ], Algorithm 10.4).”
BackgroundMethodResultInfluentialSelf-citationUnivariate real root isolation in an extension field
Strzeboński, A., & Tsigaridas, E. (2011) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1993886.1993934 · Cited by 24
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Chen, C., & Maza, M. M. (2014) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608666 · Cited by 22
Narkawicz, A. J., Munoz, C. A., & Dutle, A. (2015) · Journal of Automated Reasoning · doi:10.1007/s10817-015-9320-x · Cited by 28
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Qiu, D., Li, L., Zou, X., Mateus, P., & Gruska, J. (2011) · Acta Informatica · doi:10.1007/s00236-011-0139-6 · Cited by 21
Kawamura, A., Müller, N., Rösnick, C., et al. (2015) · Journal of Complexity · doi:10.1016/j.jco.2015.05.001 · Cited by 23
Cylindrical algebraic decomposition with equational constraints
England, M., Bradford, R., & Davenport, J. H. (2019) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2019.07.019 · Cited by 31
“A complexity analysis (Bradford et al., 2016, Section 2) showed that making use of a single EC in this way reduces the double exponent of m in the complexity bound for CAD by 1. Some natural questions arising are: • Can savings be made iteratively in the presence of multiple ECs? • Do those savings further reduce the…”
BackgroundInfluentialNearly optimal refinement of real roots of a univariate polynomial
Pan, V. Y., & Tsigaridas, E. (2015) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2015.06.009 · Cited by 22
Huang, Z., England, M., Davenport, J. H., et al. (2016) · Apollo (University of Cambridge) · doi:10.17863/cam.38371 · Cited by 22
Arrangements on Parametric Surfaces II: Concretizations and Applications
Berberich, E., Fogel, E., Halperin, D., et al. (2010) · Mathematics in Computer Science · doi:10.1007/s11786-010-0043-4 · Cited by 22
Unifying Known Lower Bounds via Geometric Complexity Theory
Grochow, J. A. (2015) · Computational Complexity · doi:10.1007/s00037-015-0103-x · Cited by 24
VanderZee, E. B., Hirani, A. N., Guoy, D., et al. (2012) · Computational Geometry · doi:10.1016/j.comgeo.2012.11.003 · Cited by 22
Culler, M., & Dunfield, N. (2018) · Geometry & Topology · doi:10.2140/gt.2018.22.1405 · Cited by 22
Parameterization of the discriminant set of a polynomial
Batkhin, A. B. (2016) · Programming and Computer Software · doi:10.1134/s0361768816020031 · Cited by 22
Using Machine Learning to Improve Cylindrical Algebraic Decomposition
Huang, Z., England, M., Wilson, D. J., Bridge, J. P., Davenport, J. H., & Paulson, L. C. (2019) · Mathematics in Computer Science · doi:10.1007/s11786-019-00394-8 · Cited by 29
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
Kaplan, H. Y., Mulzer, W., Roditty, L., et al. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28335 · Cited by 22
Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
Gortler, S. J., & Thurston, D. P. (2014) · Fields Institute communications · doi:10.1007/978-1-4939-0781-6_8 · Cited by 26
Root isolation of zero-dimensional polynomial systems with linear univariate representation
Cheng, J.-S., Gao, X.-S., & Guo, L. (2011) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2011.12.011 · Cited by 22
Efficient real root approximation
Kerber, M., & Sagraloff, M. (2011) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1993886.1993920 · Cited by 21
The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
England, M., & Davenport, J. H. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45641-6_12 · Cited by 21
“For some problems there exist algorithms with better complexity [2], however, CAD implementations remain the best general purpose approach for many.”
BackgroundKinetic prisms: incorporating acceleration limits into space–time prisms
Kuijpers, B., Miller, H. J., & Othman, W. (2017) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2017.1356462 · Cited by 21
“For an overview of the inherent complexity of quanti fi er-elimination problems, we refer to Basu et al .”
MethodColoring k k -free intersection graphs of geometric objects in the plane
Fox, J., & Pach, J. (2008) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1377676.1377735 · Cited by 21
Semi-algebraic functions have small subdifferentials
Drusvyatskiy, D., & Lewis, A. S. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0624-x · Cited by 21
Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem
Basu, S., & Zell, T. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9062-4 · Cited by 21
“There is a large body of research in this area (see [3] for background).”
BackgroundSelf-citationThe core variety of a multisequence in the truncated moment problem
Fialkow, L. A. (2017) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2017.07.041 · Cited by 21
Open Research Areas in Distance Geometry
Liberti, L., & Lavor, C. (2018) · Springer optimization and its applications · doi:10.1007/978-3-319-99142-9_11 · Cited by 25
“ted components can either be uncountable sets or consist of an isolated point. A second method of proof consists in invoking the cylindrical algebraic decomposition results in real algebraic geometry [17, 15], which stem from Tarski’s quantier elimination theory [138], to show that 2Another, and possibly better, candi…”
MethodPlatzer, A. (2014) · Cited by 26
On multicorns and unicorns II: bifurcations in spaces of antiholomorphic polynomials
MUKHERJEE, S., NAKANE, S., & SCHLEICHER, D. (2015) · Ergodic Theory and Dynamical Systems · doi:10.1017/etds.2015.65 · Cited by 21
Some new results on decidability for elementary algebra and geometry
Solovay, R. M., Arthan, R., & Harrison, J. (2012) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2012.04.003 · Cited by 23
Counterexamples to Strassen’s direct sum conjecture
Shitov, Y. N. (2019) · Acta Mathematica · doi:10.4310/acta.2019.v222.n2.a3 · Cited by 25
“23 in [2]) allows us to assume that Ψ is a conjunction of clauses (f1∗10)∨ .”
BackgroundValidating Numerical Semidefinite Programming Solvers for Polynomial Invariants
Roux, P., Voronin, Y.-L., & Sankaranarayanan, S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53413-7_21 · Cited by 23
Sun, S. (2022) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-021-08227-4 · Cited by 20
Zhang, Z., Zhang, Y., Han, R., et al. (2022) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2022.3191934 · Cited by 20
Parameter synthesis for Markov models: covering the parameter space
Junges, S., Ábrahám, E., Hensel, C., Jansen, N., Katoen, J.-P., Quatmann, T., & Volk, M. (2024) · Formal Methods in System Design · doi:10.1007/s10703-023-00442-x · Cited by 49
Real root finding for determinants of linear matrices
Henrion, D., Naldi, S., & Din, M. S. E. (2015) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2015.06.010 · Cited by 20
“So far, it is an open problem to get a competitive implementation of the algorithms in [8]: unbounded and singular cases imply algebraic manipulations that have no impact on the complexity class but require to work over Puiseux series fields, and this increases the constant hidden by the big-O notation in the exponent.”
BackgroundSpecial algorithm for stability analysis of multistable biological regulatory systems
Hong, H., Tang, X., & Xia, B. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.09.039 · Cited by 23
“It is well known that the real quantifier elimination problem can be carried out algorithmically.”
BackgroundParametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
Hutschenreiter, L., Christel Baier, A., & Klein, J. (2017) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.256.2 · Cited by 18
A PSPACE construction of a hitting set for the closure of small algebraic circuits
Forbes, M. A., & Shpilka, A. (2018) · ACM SIGACT Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188792 · Cited by 20
New Error Measures and Methods for Realizing Protein Graphs from Distance Data
D’Ambrosio, C., Vu, K., Lavor, C., Liberti, L., & Maculan, N. (2017) · Discrete & Computational Geometry · doi:10.1007/s00454-016-9846-7 · Cited by 22
“G is rigid, so | X | is finite [35]; – in particular, | X | is a power of two [39]; – the BP algorithm is fixed-parameter tractable (FPT) on the DMDGP [37], and in all the protein instances we tested, the parameter was always fixed at the same constant, yielding polytime behaviour.”
Separating linear forms and Rational Univariate Representations of bivariate systems
Bouzidi, Y., Lazard, S., Pouget, M., et al. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.08.009 · Cited by 20
Real algebraic numbers and polynomial systems of small degree
Emiris, I. Z., & Tsigaridas, E. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.09.009 · Cited by 20
Summary on non-Archimedean valued fields
Comicheo, A. B., & Shamseddine, K. (2018) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/704/14158 · Cited by 20
A generic algebraic kernel for non-linear geometric applications
Berberich, E., Hemmer, M., & Kerber, M. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998224 · Cited by 19
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications
Kaplan, H., Mulzer, W., Roditty, L., et al. (2020) · Discrete & Computational Geometry · doi:10.1007/s00454-020-00243-7 · Cited by 19
An efficient algorithm for the stratification and triangulation of an algebraic surface
Berberich, E., Kerber, M., & Sagraloff, M. (2009) · Computational Geometry · doi:10.1016/j.comgeo.2009.01.009 · Cited by 26
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking
Choi, V., & Goyal, N. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27801-6_21 · Cited by 19
“The generation can be done by one of the many available algorithms in real algebraic geometry, see for example Chapter 11.6 of [3], which takes time, in our situation, 2 O ( d 3 ) .”
BackgroundInfluentialSemidefinite programming and sums of hermitian squares of noncommutative polynomials
Klep, I., & Povh, J. (2009) · Journal of Pure and Applied Algebra · doi:10.1016/j.jpaa.2009.07.003 · Cited by 19
Stress Matrices and Global Rigidity of Frameworks on Surfaces
Jackson, B., & Nixon, A. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-015-9724-8 · Cited by 16
“We refer the reader to [2,3] for more information on semi-algebraic sets.”
BackgroundArrangement computation for planar algebraic curves
Berberich, E., Emeliyanenko, P., Kobel, A., et al. (2012) · doi:10.1145/2331684.2331698 · Cited by 18
Deciding reachability of the infimum of a multivariate polynomial
Greuet, A., & Din, M. S. E. (2011) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1993886.1993910 · Cited by 18
Continuous amortization and extensions: With applications to bisection-based root isolation
Burr, M. (2016) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2016.01.007 · Cited by 18
Certified non-conservative tests for the structural stability of discrete multidimensional systems
Bouzidi, Y., Quadrat, A., & Rouillier, F. (2018) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-018-0596-y · Cited by 19
Slowness vector versus ray direction in polar anisotropic media
Ravve, I., & Koren, Z. (2021) · Geophysical Journal International · doi:10.1093/gji/ggab061 · Cited by 18
Solution formulas for cubic equations without or with constraints
Zhao, T. D., Wang, D., & Hong, H. (2011) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2011.02.001 · Cited by 18
“The representations of the real solutions coupled with real constraints are achieved by combining Thom’s lemma (Basu et al., 2006, p. 50) and the complex-solution formulas.”
Fawzi, H. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04163-2 · Cited by 36
Wilkie's conjecture for restricted elementary functions
Binyamini, G., & Novikov, D. (2017) · Annals of Mathematics · doi:10.4007/annals.2017.186.1.6 · Cited by 18
Basu, S., Ṗasechnik, D. V., & Roy, M.-F. (2008) · Journal of Algebra · doi:10.1016/j.jalgebra.2008.09.043 · Cited by 17
Self-citationComplete abstractions of dynamical systems by timed automata
Sloth, C., & Wisniewski, R. (2012) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2012.05.003 · Cited by 17
Computing the Fréchet Distance between Folded Polygons
Cook, A. F., Driemel, A., Har-Peled, S., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22300-6_23 · Cited by 17
Separation bounds for polynomial systems
Emiris, I. Z., Mourrain, B., & Tsigaridas, E. (2019) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2019.07.001 · Cited by 17
“The following proposition [3, 9, 16] ensures the existence of a separating element.”
BackgroundOn Exact Polya and Putinar's Representations
Magron, V., & Din, M. S. E. (2018) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3208976.3208986 · Cited by 23
Regions of multistationarity in cascades of Goldbeter–Koshland loops
Giaroli, M., Bihan, F., & Dickenstein, A. (2018) · Journal of Mathematical Biology · doi:10.1007/s00285-018-1304-0 · Cited by 17
Conormal Spaces and Whitney Stratifications
Helmer, M., & Nanda, V. (2022) · Foundations of Computational Mathematics · doi:10.1007/s10208-022-09574-8 · Cited by 17
“All general purpose quantifier-elimination software we are aware of uses some form of cylindrical algebraic decomposition, [1, 4, 9], which has complexity bounds doubly exponential in the number of variables.”
BackgroundMethodReal Quantifier Elimination in the RegularChains Library
Chen, C., & Maza, M. M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44199-2_44 · Cited by 17
Ball Packings with Periodic Constraints
Connelly, R., Shen, J. D., & Smith, A. D. S. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9636-z · Cited by 17
“From [1], we know that a real algebraic set consists of finitely many path connected components.”
Source localization and denoising: a perspective from the TDOA space
Compagnoni, M., Canclini, A., Bestagini, P., Antonacci, F., Sarti, A., & Tubaro, S. (2016) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-016-0400-9 · Cited by 22
“Moreover, we can reasonably conjecture that Θ n can be described again in terms of algebraic equations and inequalities, hence it is a so called semialgebraic variety (Basu et al, 2006).”
BackgroundComputing real witness points of positive dimensional polynomial systems
Wu, W., Reid, G. J., & Feng, Y. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.03.035 · Cited by 17
The impact on the properties of the EFGM copulas when extending this family
Saminger‐Platz, S., Kolesárová, A., Šeliga, A., et al. (2020) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2020.11.001 · Cited by 17
Detecting Level Crossings without Looking at the Spectrum
Bhattacharya, M., & Raman, C. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.140405 · Cited by 17
Faster real feasibility via circuit discriminants
Bihan, F., Rojas, J. M., & Stella, C. E. (2009) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1576702.1576711 · Cited by 17
On the complexity of real solving bivariate systems
Diochnos, D. I., Emiris, I. Z., & Tsigaridas, E. (2007) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/1277548.1277567 · Cited by 17
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Rational univariate representations of bivariate systems and applications
Bouzidi, Y., Lazard, S., Pouget, M., et al. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465519 · Cited by 16
Interlacing Ehrhart polynomials of reflexive polytopes
Higashitani, A., Kummer, M., & Michałek, M. (2017) · Selecta Mathematica · doi:10.1007/s00029-017-0350-6 · Cited by 16
Parametrized homology via zigzag persistence
Carlsson, G., de Silva, V., Kališnik, S., & Morozov, D. (2019) · eScholarship (California Digital Library) · Cited by 16
Scenario-based verification of uncertain parametric MDPs
Badings, T., Cubuktepe, M., Jansen, N., Junges, S., Katoen, J.-P., & Topcu, U. (2022) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-022-00673-z · Cited by 2
“Note that Iφ is measurable for all specifications mentioned in this paper, as it partitions VM into a finite union of semi-algebraic sets [8,57].”
BackgroundQuantization of general linear electrodynamics
Rivera, S., & Schuller, F. P. (2011) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.83.064036 · Cited by 18
“which implies that P is hyperbolic [33, 34].”
An algorithm for determining copositive matrices
Xu, J., & Yao, Y. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.04.038 · Cited by 13
Qualitative Spatial Reasoning for Applications
Wolter, D., & Wallgrün, J. O. (2012) · Advances in geospatial technologies book series · doi:10.4018/978-1-61692-868-1.ch011 · Cited by 15
Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs
Emiris, I. Z., Tsigaridas, E., & Varvitsiotis, A. (2012) · Springer eBooks · doi:10.1007/978-1-4614-5128-0_2 · Cited by 15
Computing rational solutions of linear matrix inequalities
Guo, Q., Din, M. S. E., & Zhi, L. (2013) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2465506.2465949 · Cited by 15
A Formal Proof of Cauchy’s Residue Theorem
Li, W., & Paulson, L. C. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-43144-4_15 · Cited by 15
“Our main motivation of this formalization is to certify the standard quantifier elimination procedure for real arithmetic: cylindrical algebraic decomposition [4].”
To Cure or Not to Cure: Consequences of Immunological Interactions in CML Treatment
Fassoni, A. C., Roeder, I., & Glauche, I. (2019) · Bulletin of Mathematical Biology · doi:10.1007/s11538-019-00608-x · Cited by 21
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.