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 501–600 of 865
On polynomial images of a closed ball
Fernando, J. F., & Ueno, C. (2022) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/88468846 · Cited by 3
Fast evaluation and root finding for polynomials with floating-point coefficients
Imbach, R., & Moroz, G. (2023) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3597066.3597112 · Cited by 3
“Solving multivariate polynomial systems can be done by eliminating variables and reducing the problem to a univariate polynomial having coefficients with different orders of magnitude [1].”
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
Chan, T. M., & Zheng, D. W. (2023) · ACM Transactions on Algorithms · doi:10.1145/3591357 · Cited by 3
Calculation of a Strong Resonance Condition in a Hamiltonian System
Batkhin, A. B., & Khaidarov, Z. K. (2023) · Computational Mathematics and Mathematical Physics · doi:10.1134/s0965542523050068 · Cited by 3
Orbit-finite linear programming
Ghosh, A., Hofman, P., & Lasota, S. (2023) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics56636.2023.10175799 · Cited by 3
“As our main contribution, we provide decision procedures for orbit-finite linear programming, both for the decision problem of solvability of systems of inequalities, and for the optimisation problem.”
On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions
Neumann, E. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45286-4_8 · Cited by 3
Hilbert Number for a Family of Piecewise Nonautonomous Equations
Bravo, J. L., Fernández, M., & Ojeda, I. (2024) · Qualitative Theory of Dynamical Systems · doi:10.1007/s12346-023-00922-9 · Cited by 3
“for (int i=2; i<=7; i=i+1) { eliminate(sat(A+L[i],c*(c^2-1))[1], a1*a2*a3*a4*a5*a6*a7*a8*b1*b2*b3*b4*b5*b6*b7*b8); }”
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic
Akshay, S., Chakraborty, S., Goharshady, A. K., Govind, R., Motwani, H. J., & Varanasi, S. T. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71162-6_6 · Cited by 6
Geometric Path Integrals. A Language for Multiscale Biology and Systems Robustness
Napoletani, D., Petricoin, E. F., & Struppa, D. C. (2012) · Springer proceedings in mathematics · doi:10.1007/978-88-470-1947-8_16 · Cited by 3
“This is problematic as it is difficult to establish the existence of solutions of real equations on domains, even in the algebraic case [3].”
BackgroundSpace Exploration via Proximity Search
Har-Peled, S., Kumar, N., Mount, D. M., et al. (2016) · Discrete & Computational Geometry · doi:10.1007/s00454-016-9801-7 · Cited by 3
“This can be done in time that is polynomial in i and exponential in d through the use of standard methods, such as the Collins cylindrical algebraic decomposition [3].”
MethodTight bounds for rational sums of squares over totally real fields
Quarez, R. (2010) · Rendiconti del Circolo Matematico di Palermo Series 2 · doi:10.1007/s12215-010-0029-8 · Cited by 3
Slow north-south dynamics on PML
Bell, M. C., & Schleimer, S. (2017) · Warwick Research Archive Portal (University of Warwick) · doi:10.4171/ggd/423 · Cited by 3
Certified Hermite Matrices from Approximate Roots - Univariate Case
Akoglu, T. A., & Szántó, Á. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-43120-4_1 · Cited by 3
A condition for multiplicity structure of univariate polynomials
Hong, H., & Yang, J. (2020) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2020.08.007 · Cited by 3
Generation of Orthogonal Grids on Curvilinear Trimmed Regions in Constant Time
Chibisov, D. O., Ganzha, V. G., Mayr, E. W., et al. (2005) · Lecture notes in computer science · doi:10.1007/11555964_9 · Cited by 3
Polynomial Complexity Recognizing a Tropical Linear Variety
Grigoriev, D. Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24021-3_11 · Cited by 3
“[5], [9], [2]) similar to the presentation”
BackgroundMethodResultInfluentialA proof of the matrix version of Baker's conjecture in Diophantine approximation
Das, T., & SIMMONS, D. (2018) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004118000269 · Cited by 3
“The authors also thank Chris Miller for pointing us to the reference [3].”
Real ideal and the duality of semidefinite programming for polynomial optimization
Sekiguchi, Y., Takenawa, T., & Waki, H. (2013) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-013-0104-6 · Cited by 4
Basu, S., & Kettner, M. (2008) · Proceedings of the London Mathematical Society · doi:10.1112/plms/pdn031 · Cited by 4
Self-citationFraction-Free Unit Circle Stability Tests
Bistritz, Y. (2014) · Circuits Systems and Signal Processing · doi:10.1007/s00034-014-9824-3 · Cited by 3
Using advanced simulation techniques to improve industrial controller's dependability
Seabra, E. A. R., & Machado, J. (2011) · 2022 IEEE 20th International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin.2011.6034848 · Cited by 3
Improving the topology computation of an arrangement of cubics
Caravantes, J., & González-Vega, L. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2008.03.001 · Cited by 3
On the solvability of derived matrix problems, including completions and duals
Johnson, C. R., & Duarte, A. L. (2016) · Linear Algebra and its Applications · doi:10.1016/j.laa.2016.08.026 · Cited by 3
“[BPR]), rendering this approach impractical for completion problems of any size.”
BackgroundLyapunov function synthesis — Algorithm and software
Leth, T., Sloth, C., & Wiśniewski, R. (2016) · doi:10.1109/cacsd.2016.7602539 · Cited by 3
Numerical stability of Euclidean algorithm over ultrametric fields
Caruso, X. (2017) · Journal de Théorie des Nombres de Bordeaux · doi:10.5802/jtnb.989 · Cited by 3
Quantitative fundamental theorem of algebra
Perrucci, D., & Roy, M.-F. (2019) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/haz008 · Cited by 5
Self-citationSubgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products
Baik, H., Petri, B., & Raimbault, J. (2019) · COMBINATORICA · doi:10.1007/s00493-019-4023-2 · Cited by 3
Complements of Unbounded Convex Polyhedra as Polynomial Images of $${{\mathbb {R}}}^n$$ R n
Fernando, J. F., & Ueno, C. (2019) · Discrete & Computational Geometry · doi:10.1007/s00454-019-00065-2 · Cited by 3
On $$\epsilon$$-sensitive monotone computations
Hrubeš, P. (2020) · Computational Complexity · doi:10.1007/s00037-020-00196-6 · Cited by 3
Hermitian matrices with a bounded number of eigenvalues
Domokos, M. (2013) · Linear Algebra and its Applications · doi:10.1016/j.laa.2013.09.040 · Cited by 3
“Note that sDisck(A) coincides with the ksubdiscriminant of the characteristic polynomial of A (we refer to Chapter 4 of [1] for basic properties of subdiscriminants), and sDisck is a homogeneous polynomial function on M of degree (n− k)(n − k − 1).”
BackgroundBrijder, R., Geerts, F., den Bussche, J. V., & Weerwag, T. (2019) · ACM SIGMOD Record · doi:10.1145/3371316.3371331 · Cited by 3
Kac-Rice formulas and the number of solutions of parametrized systems of polynomial equations
Feliu, E., & Sadeghimanesh, A. (2022) · Mathematics of Computation · doi:10.1090/mcom/3760 · Cited by 3
Study of D-decompositions by the methods of computational real-valued algebraic geometry
Vasil’ev, O. O. (2012) · Automation and Remote Control · doi:10.1134/s0005117912120041 · Cited by 4
“Monograph [3] is a standart reference book on the subject.”
BackgroundSubquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model
Aronov, B. S., de Berg, M., Cardinal, J., et al. (2022) · Computational Geometry · doi:10.1016/j.comgeo.2022.101945 · Cited by 3
Eigenvalue Placement by Quantifier Elimination - the Static Output Feedback Problem
Röbenack, K., & Voßwinkel, R. (2020) · Acta Cybernetica · doi:10.14232/actacyb.24.3.2020.8 · Cited by 5
Basu, S., Pollack, R., & Roy, M.-F. (2009) · COMBINATORICA · doi:10.1007/s00493-009-2357-x · Cited by 7
Self-citationBasu, S., & Riener, C. (2017) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/697/14046 · Cited by 3
Self-citationFaster one block quantifier elimination for regular polynomial systems of equationsPreprint
Le, H. P., & Din, M. S. E. (2021) · INRIA a CCSD electronic archive server · Cited by 3
Strong resonances in nonlinear Hamiltonian systemPreprint
Batkhin, A. B., & Khaydarov, Z. K. U. (2022) · Keldysh Institute Preprints · doi:10.20948/prepr-2022-59 · Cited by 3
An improved complexity bound for computing the topology of a real algebraic space curve
Cheng, J.-S., Jin, K., Pouget, M., et al. (2024) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2024.102309 · Cited by 2
“Lemma 4.2 ([4, 30, 34]) .”
InfluentialPartial reformulation-linearization based optimization models for the Golomb ruler problem
Ouzia, H. (2024) · RAIRO - Operations Research · doi:10.1051/ro/2024121 · Cited by 2
On Minimal and Minimum Cylindrical Algebraic Decompositions
Michel, L., Mathonet, P., & Zénaïdi, N. (2024) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3666000.3669704 · Cited by 3
A unified Casson–Lin invariant for the real forms of SL(2)
Dunfield, N. M., & Rasmussen, J. (2025) · Geometry & Topology · doi:10.2140/gt.2025.29.4055 · Cited by 2
The Existential Theory of the Reals as a Complexity Class: A Compendium
Schaefer, M., Cardinal, J., & Miltzow, T. (2026) · Bolyai Society mathematical studies · doi:10.1007/978-3-032-10503-5_5 · Cited by 62
A constructive formalisation of Semi-algebraic sets and functions
Djalal, B. (2018) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3167099 · Cited by 2
Tractability conditions for numeric CSPs
Jönsson, P., & Thapper, J. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2018.01.013 · Cited by 2
On the Reeb Spaces of Definable Maps
Basu, S., Cox, N., & Percival, S. (2022) · Discrete & Computational Geometry · doi:10.1007/s00454-022-00400-0 · Cited by 3
Self-citationMultiparameter perturbation theory of matrices and linear operators
Parusiński, A., & Rond, G. (2019) · Transactions of the American Mathematical Society · doi:10.1090/tran/8061 · Cited by 3
Algorithmic Aspects of Immersibility and Embeddability
Manin, F., & Weinberger, S. (2024) · International Mathematics Research Notices · doi:10.1093/imrn/rnae170 · Cited by 5
DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS
Schmerl, J. H. (2018) · Journal of Symbolic Logic · doi:10.1017/jsl.2017.47 · Cited by 3
“(3) =⇒ (1): Assume (3) and letf be an immersion ofL(R , P) intoH .”
InfluentialA Mathematical Model for a Transmissible Disease with a Variant
Otto, A., & Amidou, M. (2022) · Journal of Applied Mathematics · doi:10.1155/2022/5050602 · Cited by 2
A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences
Nuspl, P., & Pillwein, V. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-14788-3_15 · Cited by 5
Counting Zeros of Random Functions
Nicolaescu, L. I. (2023) · American Mathematical Monthly · doi:10.1080/00029890.2023.2206321 · Cited by 2
Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size
Davis, M. M., & Papp, D. (2023) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2023.102254 · Cited by 2
Asymmetric tropical distances and power diagrams
Comăneci, A., & Joswig, M. (2023) · Algebraic Combinatorics · doi:10.5802/alco.306 · Cited by 3
Certified algorithms for equilibrium states of local quantum Hamiltonians
Fawzi, H., Fawzi, O., & Scalet, S. O. (2023) · HAL · doi:10.48550/arxiv.2311.18706 · Cited by 2
“More specifically, we use quantifier elimination [53, 54] to decide whether the hierarchy augmented by ˜ ω ( O ) > a or augmented by ˜ ω ( O ) a is feasible.”
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Brand, C., Ganian, R., Röder, S., et al. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49275-4_5 · Cited by 2
On the complexity of analyticity in semi-definite optimization
Basu, S., & Mohammad-Nezhad, A. (2024) · Advances in Applied Mathematics · doi:10.1016/j.aam.2024.102670 · Cited by 5
“By complexity of an algorithm we will mean the number of arithmetic operations in the ring Z including comparisons needed by the algo-rithm (see [4, Chapter 8]).”
BackgroundMethodResultInfluentialSelf-citationConnectivity in Symmetric Semi-Algebraic Sets
Riener, C., Schabert, R., & Vu, T. X. (2024) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3666000.3669687 · Cited by 2
Computational Dynamical Systems
Cotler, J. S., & Rezchikov, S. (2024) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs61266.2024.00021 · Cited by 4
Stationary solitons in discrete nonlinear Schrödinger with non-nearest neighbour interactions
Rothos, V. M., Anastassiou, S., & Hadjifotinou, K. G. (2025) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2024.0539 · Cited by 3
“To determine for which values of a, b, p ( x ) possesses real roots, we shall employ the Sturm theorem (see [28]).”
Phase portraits, Lyapunov functions, and projective geometry
Naiwert, L., & Spindler, K. (2020) · Mathematische Semesterberichte · doi:10.1007/s00591-020-00288-y · Cited by 2
“[12, 14, 17, 18]; also see [4] and [16] for relevant background.”
BackgroundBlažková, E., & Šı́r, Z. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-54382-1_4 · Cited by 2
Incidence Bounds on Multijoints and Generic Joints
Iliopoulou, M. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-015-9703-0 · Cited by 2
“8, as well as the following, which can be found, for example, in [1]:”
BackgroundAlgorithmics of Checking whether a Mapping Is Injective, Surjective, and/or Bijective
Balreira, E. C., Kosheleva, O., & Kreinovich, V. (2014) · Studies in computational intelligence · doi:10.1007/978-3-319-04280-0_1 · Cited by 2
Direct symbolic transformation from 3D cartesian into hyperboloidal coordinates
Diaz–Toca, G. M., & Necula, I. (2013) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.11.099 · Cited by 2
Separating inequalities for nonnegative polynomials that are not sums of squares
Iliman, S., & de Wolff, T. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.09.010 · Cited by 3
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Basu, S., & Zell, T. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-9014-1 · Cited by 4
“Using the best known complexity estimates for quantifier elimination algorithms over the reals (see [11]), we get single exponential (in k and m) bounds on the degrees and the number of polynomials necessary to obtain a semi-algebraic description of π(S).”
BackgroundSelf-citationOn the Number of Topological Types Occurring in a Parameterized Family of Arrangements
Basu, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9079-5 · Cited by 2
“Proof. The proof given in [ 4 ] (see Lemma 16.17) for the semi-algebraic case can be easily adapted to the o-minimal setting using Hardt triviality for denable families instead of for semi-algebraic ones.”
InfluentialSelf-citationTopology of Families of Implicit Algebraic Surfaces Depending on a Parameter
Alcázar, J. G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23568-9_3 · Cited by 2
Geometric permutations of non-overlapping unit balls revisited
Ha, J.-S., Cheong, O., Goaoc, X., et al. (2015) · Computational Geometry · doi:10.1016/j.comgeo.2015.12.003 · Cited by 2
“Various algorithms are known to answer this question and several implementations are available [23], so in principle settling our conjecture is only a matter of computational resources.”
BackgroundAbstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase
Passmore, G. O., & Jackson, P. B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30870-3_56 · Cited by 2
The classification of real singularities using Singular Part III: Unimodal singularities of corank 2
Böhm, J., Marais, M. S., & Steenpaß, A. (2019) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2019.06.003 · Cited by 2
Xu, X., Li, Q., & Sun, Y. (2015) · Journal of Systems Science and Complexity · doi:10.1007/s11424-015-3087-3 · Cited by 2
On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
Basu, S., & Riener, C. (2018) · Selecta Mathematica · doi:10.1007/s00029-018-0401-7 · Cited by 2
Self-citationMukherjee, S. (2017) · Discrete and Continuous Dynamical Systems · doi:10.3934/dcds.2017110 · Cited by 2
Quantitative curve selection lemma
Basu, S., & Roy, M.-F. (2021) · Mathematische Zeitschrift · doi:10.1007/s00209-021-02837-0 · Cited by 2
“The proof of our quantitative statement is following the same strategy, extracting explicit bounds on the description of the path from the use of algorithms from [1,2].”
MethodInfluentialSelf-citationA reduction for the distinct distances problem in Rd
Bardwell-Evans, S., & Sheffer, A. (2019) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2019.02.010 · Cited by 3
Permutations encoding the local shape of level curves of real polynomials via generic projections
Sorea, M. (2022) · Annales de l’institut Fourier · doi:10.5802/aif.3479 · Cited by 2
Using Maple to Compute the Intersection Curve of Two Quadrics: Improving the Intersectplot Command
González-Vega, L., & Trocado, A. E. B. D. S. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-41258-6_7 · Cited by 2
Distinct Distances on Non-Ruled Surfaces and Between Circles
Mathialagan, S., & Sheffer, A. (2022) · Discrete & Computational Geometry · doi:10.1007/s00454-022-00449-x · Cited by 2
“Thus, the proof follows from the proof of the cylindrical decomposition theorem (for example, see [3]).”
BackgroundGlobal Łojasiewicz inequalities on comparing the rate of growth of polynomial functions
Đinh, S. T., Guo, F., & Phạm, T.-S. (2021) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2021.125057 · Cited by 2
“In this subsection, we recall some notions and results of semi-algebraic geometry, which can be found in [1, 2, 3, 5, 33].”
BackgroundThe computability of LQR and LQG control
Majumdar, R., & Soudjani, S. (2021) · International Conference on Hybrid Systems: computation and control · doi:10.1145/3447928.3456634 · Cited by 2
“Since that theory is decidable [4], the decidability of the infinite horizon problem follows.”
Background姚, 勇. (2010) · Scientia Sinica Mathematica · doi:10.1360/za2010-40-3-251 · Cited by 2
A First Complete Algorithm for Real Quantifier Elimination in Isabelle/HOL
Kosaian, K., Tan, Y., & Platzer, A. (2023) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3573105.3575672 · Cited by 7
“1] (with an unnecessary assumption removed that is not included in other references [1] or in Isabelle’s existing formalization [21] of the Sturm-Tarski theorem).”
BackgroundFaster real root decision algorithm for symmetric polynomials
Labahn, G., Riener, C., Din, M. S. E., et al. (2023) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3597066.3597097 · Cited by 2
Multiplicity Problems on Algebraic Series and Context-Free Grammars
Balaji, N., Clemente, L., Nosan, K., et al. (2023) · Proceedings - Symposium on Logic in Computer Science · doi:10.1109/lics56636.2023.10175707 · Cited by 2
Tunçel, L., Vavasis, S. A., & Xu, J. (2023) · Foundations of Computational Mathematics · doi:10.1007/s10208-023-09637-4 · Cited by 8
Sketching Approximability of All Finite CSPs
Chou, C.-N., Golovnev, A., Sudan, M., & Velusamy, S. (2024) · Journal of the ACM · doi:10.1145/3649435 · Cited by 23
Some lower bounds for the complexity of the linear programming feasibility problem over the reals
Grimson, R., & Kuijpers, B. (2008) · Journal of Complexity · doi:10.1016/j.jco.2008.07.002 · Cited by 2
“Modern quantifier-elimination procedures work in doubly-exponential time in thenumber of quantifier alternations of the input formula (see the seminal paper of Grigoriev [16] for the existential theory and [29,20,2] for the general case; a complete account can be found in [3]).”
BackgroundSegregation of stability domains of the Hamilton nonlinear system
Batkhin, A. B. (2013) · Automation and Remote Control · doi:10.1134/s0005117913080043 · Cited by 2
The ‘Life Machine’: A Quantum Metaphor for Living Matter
Rasetti, M. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3177-6 · Cited by 2
“Efficient algorithms are known for the computation of homology groups [22].”
BackgroundModeling virtual channel to enforce runtime properties for IoT services
Zhang, Y. A., & Chen, J. (2017) · doi:10.1145/3018896.3025150 · Cited by 2
Verified computations for closed hyperbolic 3‐manifolds
Goerner, M. (2020) · Bulletin of the London Mathematical Society · doi:10.1112/blms.12445 · Cited by 2
Zero counting for a class of univariate Pfaffian functions
Barbagallo, M. L., Jeronimo, G., & Sabia, J. (2016) · Journal of Algebra · doi:10.1016/j.jalgebra.2015.11.050 · Cited by 2
“The procedure is based on the construction of a family of Sturm sequences associated to the given function f(x), which is done by means of polynomial subresultant techniques (see, for instance, [1]).”
MethodOn a concept of genericity for RLC networks
Hughes, T. H., Morelli, A., & SMITH, M. C. (2019) · Systems & Control Letters · doi:10.1016/j.sysconle.2019.104562 · Cited by 2
Angeles, J., & Bai, S. (2022) · Mathematical engineering · doi:10.1007/978-3-031-09544-3_5 · Cited by 2
A moment approach to analyze zeros of triangular polynomial sets
Lasserre, J. B. (2005) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-05-03972-3 · Cited by 2
“Mr0(ui ,s ) is the matrix associated with the multivariate Hermite’s quadratic form Her(G ,u i), and whose signature gives the number of real zeros of G that satisfy ui(x) > 0 minus the number of real zeros that satisfy ui(x) 4, Theorem 4.72 ]).”
BackgroundInfluentialApproximate Generalizations and Applied Equilibrium AnalysisPreprint
Kübler, F. (2005) · SSRN Electronic Journal · doi:10.2139/ssrn.720421 · Cited by 2
Properties of Estimated Characteristic RootsPreprint
Nielsen, B. J., & Nielsen, H. B. (2008) · SSRN Electronic Journal · doi:10.2139/ssrn.1146453 · Cited by 2
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.