{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:25:05Z","timestamp":1772295905800,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T00:00:00Z","timestamp":1167264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10208-005-0208-8","type":"journal-article","created":{"date-parts":[[2007,2,6]],"date-time":"2007-02-06T21:47:12Z","timestamp":1170798432000},"page":"45-80","source":"Crossref","is-referenced-by-count":11,"title":["Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time"],"prefix":"10.1007","volume":"8","author":[{"given":"Saugata","family":"Basu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,28]]},"reference":[{"key":"208_CR1","doi-asserted-by":"crossref","unstructured":"A. A. Agrachev, Topology of quadratic maps and Hessians of smooth maps, in Algebra, Topology, Geometry, Vol. 26 (Russian), pp. 85\u2013124, 162. Itogi Nauki i Tekhniki, Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Inform., Moscow, 1988. Translated in J. Soviet Math. 49(3) (1990), 990\u20131013.","DOI":"10.1007\/BF02133177"},{"key":"208_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02573959","volume":"10","author":"A. I. Barvinok","year":"1993","unstructured":"A. I. Barvinok, Feasability testing for systems of real quadratic equations, Discrete Comput. Geom. 10 (1993), 1\u201313.","journal-title":"Discrete Comput. Geom."},{"key":"208_CR3","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1016\/j.jsc.2006.07.001","volume":"41","author":"S. Basu","year":"2006","unstructured":"S. Basu, Computing the first few Betti numbers of semialgebraic sets in single exponential time, J. Symbolic Comput. 41 (2006), 1125\u20131154.","journal-title":"J. Symbolic Comput."},{"key":"208_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009443","volume":"22","author":"S. Basu","year":"1999","unstructured":"S. Basu, On bounding the Betti numbers and computing the Euler characteristics of semialgebraic sets, Discrete Comput. Geom. 22 (1999), 1\u201318.","journal-title":"Discrete Comput. Geom."},{"key":"208_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s00454-003-2922-9","volume":"30","author":"S. Basu","year":"2003","unstructured":"S. Basu, On different bounds on different Betti numbers, Discrete Comput. Geom. 30 (2003), 65\u201385.","journal-title":"Discrete Comput. Geom."},{"key":"208_CR6","unstructured":"S. Basu, R. Pollack, and M.-F. Roy, Computing the first Betti number and the connected components of semialgebraic sets, submitted, Found. Comput. Math. Available at [arXiv:math.AG\/0603248]."},{"key":"208_CR7","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S. Basu","year":"1996","unstructured":"S. Basu, R. Pollack, and M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, J. ACM 43 (1996), 1002\u20131045.","journal-title":"J. ACM"},{"issue":"1","key":"208_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1090\/S0894-0347-99-00311-2","volume":"3","author":"S. Basu","year":"1999","unstructured":"S. Basu, R. Pollack, and M.-F. Roy, Computing roadmaps of semialgebraic sets on a variety, J. Amer. Math. Soc. 3(1) (1999), 55\u201382.","journal-title":"J. Amer. Math. Soc."},{"key":"208_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2006","unstructured":"S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, 2nd ed., Springer-Verlag, New York, 2006.","edition":"2"},{"key":"208_CR10","volume-title":"Complexity and Real Computation","author":"L. Blum","year":"1997","unstructured":"L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1997."},{"key":"208_CR11","volume-title":"G\u00e9om\u00e9trie alg\u00e9brique r\u00e9elle","author":"J. Bochnak","year":"1987","unstructured":"J. Bochnak, M. Coste, and M.-F. Roy, G\u00e9om\u00e9trie alg\u00e9brique r\u00e9elle, Springer-Verlag, New York, 1987. Real Algebraic Geometry, Springer-Verlag, New York, 1998."},{"key":"208_CR12","volume-title":"Sheaf Theory","author":"G. E. Bredon","year":"1996","unstructured":"G. E. Bredon, Sheaf Theory, Springer-Verlag, New York, 1996."},{"issue":"2","key":"208_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.jco.2005.11.001","volume":"22","author":"P. Burgisser","year":"2006","unstructured":"P. Burgisser and F. Cucker, Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets, Journal of Complexity 22(2) (2006), 147\u2013191.","journal-title":"Journal of Complexity"},{"key":"208_CR14","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1093\/comjnl\/36.5.504","volume":"36","author":"J. Canny","year":"1993","unstructured":"J. Canny, Computing road maps in general semialgebraic sets, Comput. J. 36 (1993), 504\u2013514.","journal-title":"Comput. J."},{"key":"208_CR15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00454-004-1105-7","volume":"33","author":"A. Gabrielov","year":"2005","unstructured":"A. Gabrielov and N. Vorobjov, Betti numbers for quantifier-free formulae, Discrete Comput. Geom. 33 (2005), 395\u2013401.","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"208_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01200148","volume":"4","author":"L. Gournay","year":"1993","unstructured":"L. Gournay and J. J. Risler, Construction of roadmaps of semialgebraic sets, Appl. Algebra Engrg. Comm. Comput. 4(4) (1993), 239\u2013252.","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"208_CR17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00037-005-0189-7","volume":"14","author":"D. Grigor\u2019ev","year":"2005","unstructured":"D. Grigor\u2019ev and D. V. Pasechnik, Polynomial time computing over quadratic maps I. Sampling in real algberaic sets, Comput. Complexity 14 (2005), 20\u201352.","journal-title":"Comput. Complexity"},{"key":"208_CR18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202001","volume":"2","author":"D. Grigor\u2019ev","year":"1992","unstructured":"D. Grigor\u2019ev and N. Vorobjov, Counting connected components of a semialgebraic set in subexponential time, Comput. Complexity 2 (1992), 133\u2013186.","journal-title":"Comput. Complexity"},{"key":"208_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/2374240","volume":"102","author":"R. M. Hardt","year":"1980","unstructured":"R. M. Hardt, Semialgebraic local triviality in semialgebraic mappings, Amer. J. Math. 102 (1980), 291\u2013302.","journal-title":"Amer. J. Math."},{"key":"208_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02573999","volume":"11","author":"J. Heintz","year":"1994","unstructured":"J. Heintz, M.-F. Roy, and P. Solern\u00f2, Description of the connected components of a semialgebraic set in single exponential time, Discrete Comput. Geom. 11 (1994), 121\u2013140.","journal-title":"Discrete Comput. Geom."},{"key":"208_CR21","series-title":"Cambridge Studies in Advanced Mathematics","volume-title":"A User\u2019s Guide to Spectral Sequences","author":"J. McCleary","year":"2001","unstructured":"J. McCleary, A User\u2019s Guide to Spectral Sequences, 2nd ed., Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 2001.","edition":"2"},{"key":"208_CR22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J. Milnor","year":"1964","unstructured":"J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964), 275\u2013280.","journal-title":"Proc. Amer. Math. Soc."},{"issue":"70","key":"208_CR23","first-page":"635","volume":"28","author":"O. A. Ole\u012dnik","year":"1951","unstructured":"O. A. Ole\u012dnik, Estimates of the Betti numbers of real algebraic hypersurfaces, Mat. Sb. (N.S.) 28(70) (1951), 635\u2013640 (Russian).","journal-title":"Mat. Sb. (N.S.)"},{"key":"208_CR24","first-page":"389","volume":"13","author":"O. A. Ole\u012dnik","year":"1949","unstructured":"O. A. Ole\u012dnik and I. B. Petrovskii, On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR 13 (1949), 389\u2013402.","journal-title":"Izv. Akad. Nauk SSSR"},{"key":"208_CR25","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994."},{"key":"208_CR26","doi-asserted-by":"crossref","unstructured":"J. Reif, Complexity of the mover\u2019s problem and generalizations, in Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 421\u2013427, 1979.","DOI":"10.1109\/SFCS.1979.10"},{"key":"208_CR27","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"J. Renegar, On the computational complexity and geometry of the first-order theory of the reals, J. Symbolic Comput. 13 (1992), 255\u2013352.","journal-title":"J. Symbolic Comput."},{"key":"208_CR28","volume-title":"Algebraic Topology","author":"E. H. Spanier","year":"1966","unstructured":"E. H. Spanier, Algebraic Topology, McGraw-Hill, New York, 1966."},{"key":"208_CR29","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1515\/9781400874842-016","volume-title":"Differential and Combinatorial Topology","author":"R. Thom","year":"1965","unstructured":"R. Thom, Sur l\u2019homologie des vari\u00e9t\u00e9s alg\u00e9briques r\u00e9elles, in Differential and Combinatorial Topology, pp. 255\u2013265, Princeton University Press, Princeton, NJ, 1965."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-005-0208-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-005-0208-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-005-0208-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:09:18Z","timestamp":1587344958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-005-0208-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,28]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1007\/s10208-005-0208-8","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,28]]}}}