- Combinatorial and Topological Complexity in Computational Geometry
- An Improved Algorithm for Quantifier Elimination Over Real Closed Saugata Basu \Lambda
- Saugata Basu Department of Mathematics
- (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation
- (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation
- The Hadwiger transversal theorem for pseudolines SAUGATA BASU
- Different bounds on the different Betti numbers of semialgebraic sets #
- On the Combinatorial and Algebraic Complexity of Quantifier Elimination
- Computing the Betti Numbers of Arrangements Saugata Basu #
- On Bounding the Betti Numbers and Computing the Euler Characteristic of Semialgebraic Sets
- Polynomials that Sign Represent Parity Descartes Rule of Signs
- BOUNDING THE NUMBER OF STABLE HOMOTOPY TYPES OF A PARAMETRIZED FAMILY OF SEMI-ALGEBRAIC SETS
- Introduction Algebraic Topological Preliminaries
- Introduction Outline of the Methods
- Saugata Basu Department of Mathematics
- Algorithmic Semi-algebraic Geometry and its applications
- Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential
- arXiv:math.AG/0605517v118May2006 ON THE NUMBER OF HOMOTOPY TYPES OF FIBRES OF A
- New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint
- Complexity of Computing Semialgebraic Descriptions of the Connected Components of a Semialgebraic Set
- On the combinatorial and algebraic complexity of Quantifier Elimination
- EFFICIENT ALGORITHM FOR COMPUTING THE EULER-POINCARE
- Introduction Ideas behind ETR and computing Euler-PoincarCharacteristic
- REFINED BOUNDS ON THE NUMBER OF CONNECTED COMPONENTS OF SIGN CONDITIONS ON A VARIETY
- ALGORITHMS IN REAL ALGEBRAIC GEOMETRY: A SURVEY SAUGATA BASU
- Algorithmic Results Projections
- On the Combinatorial and Topological Complexity of a Single Cell Saugata Basu
- A COMPLEX ANALOGUE OF TODA'S THEOREM SAUGATA BASU
- The Univariate Problem The Multivariate Case
- New bounds for Betti numbers of semi-algebraic sets and algorithms for
- COMPUTING THE FIRST BETTI NUMBER AND DESCRIBING THE CONNECTED COMPONENTS OF SEMIALGEBRAIC SETS
- JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
- Proceedings ISSAC 97 Uniform Quantifier Elimination and Constraint Query Processing
- A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials
- On Bounding the Betti Numbers and Computing the Euler Characteristic of Semialgebraic Sets
- ON THE BETTI NUMBERS OF SIGN CONDITIONS SAUGATA BASU, RICHARD POLLACK, AND MARIE-FRANCOISE ROY
- (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation
- Introduction O-minimal Structures and Admissible Sets
- Introduction Quantitative Bounds
- Introduction Arrangements
- Introduction Recent Results
- Different Bounds on the Different Betti Numbers of Semi-algebraic Sets
- ON HOMOTOPY TYPES OF LIMITS OF SEMI-ALGEBRAIC SETS AND ADDITIVE COMPLEXITY OF POLYNOMIALS
- Proc. London Math. Soc. Page 1 of 24 Ce2009 London Mathematical Society doi:10.1112/plms/pdp031
- COMPUTING THE BETTI NUMBERS OF SEMI-ALGEBRAIC SETS DEFINED BY PARTLY QUADRATIC SYSTEMS OF
- ON THE NUMBER OF TOPOLOGICAL TYPES OCCURRING IN A PARAMETRIZED FAMILY OF ARRANGEMENTS
- COMPUTING THE TOP BETTI NUMBERS OF SEMI-ALGEBRAIC SETS DEFINED BY QUADRATIC
- ON PROJECTIONS OF SEMI-ALGEBRAIC SETS DEFINED BY FEW QUADRATIC INEQUALITIES
- COMPUTING THE EULER-POINCARE CHARACTERISTICS
- DOI: 10.1007/s00454-002-2799-z Discrete Comput Geom 29:4159 (2003) Discrete & Computational
- DOI: 10.1007/s00454-003-2922-9 Discrete Comput Geom 30:6585 (2003) Discrete & Computational
- 1. page 10, l -7. "bounded" should be "bound". 2. page 13, l 21. "coprime is" should be "coprime if".
- SEMI-MONOTONE SETS SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV
- POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA'S THEOREM
- Introduction Arrangements
- (Discrete) Polynomial Hierarchy Blum-Shub-Smale Models of Computation
- Computing the Betti Numbers of Arrangements via Spectral Sequences
- Combinatorial Complexity in O-minimal Geometry Saugata Basu
- Computing the Betti Numbers of Arrangements
- New bounds for Betti numbers of semi-algebraic sets and algorithms for
- Betti Numbers, Spectral Sequences and Algorithms for computing them
- Computing Roadmaps of Semialgebraic Sets (Extended Abstract)
- POLYNOMIAL HIERARCHY, BETTI NUMBERS AND A REAL ANALOGUE OF TODA'S THEOREM
- Combinatorial Complexity in O-minimal Saugata Basu
- A SHARPER ESTIMATE ON THE BETTI NUMBERS OF SETS DEFINED BY QUADRATIC INEQUALITIES
- A COMPLEX ANALOGUE OF TODA'S THEOREM SAUGATA BASU
- SEMI-MONOTONE SETS SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV
- Saugata Basu Department of Mathematics
- Saugata Basu Department of Mathematics
- REFINED BOUNDS ON THE NUMBER OF CONNECTED COMPONENTS OF SIGN CONDITIONS ON A VARIETY
- TORIC CUBES ARE CLOSED BALLS SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV
- History and previous results Main result
- arXiv:1201.0491v1[math.LO]2Jan2012 MONOTONE FUNCTIONS AND MAPS
- A HELLY-TYPE THEOREM FOR SEMI-MONOTONE SETS AND MONOTONE MAPS
- A BABY STEP-GIANT STEP ROADMAP ALGORITHM FOR GENERAL ALGEBRAIC SETS
