Pankaj K. Agarwal, Its Relatives In, B. Chazelle, J. E. Goodman, R. Pollack, Advances In Discrete, ...
[1] P. K. Agarwal. Partitioning arrangements of lines II: Applications. Discrete & Computational
Checking Algorithms for Pure Type Systems L.S. van Benthem Jutting 1 (2007)
This work is motivated by the problem of finding reasonable algorithms for typechecking Pure Type Systems [Bar91] (PTS). There are several implementations of formal systems that are either PTS or...
Computing Roadmaps of Semi-algebraic Sets (Extended Abstract) (2007)
) S. Basu R. Pollack y M.-F. Roy z Department of Department of Department of Computer Science, Mathematics, Mathematics, Courant Institute Courant Institute Universit'e de Rennes New York, New...
Book Review: Algorithms in Real Algebraic Geometry (2007)
S. Basu, R. Pollack, J. Maurice Rojas
Much like physics, the study of algorithms leads us to beautiful ideas that would otherwise be overlooked by purely abstract reflection. Moreover, as engineers and computational scientists already...
On the Combinatorial and Algebraic Complexity of Quantifier Elimination (1994)
In this paper we give a new algorithm for performing quantifier elimination from first order formulae over real closed fields. This algorithm improves the complexity of the asymptotically fastest...
Checking Algorithms for Pure Type Systems (1992)
this paper. 1.1 Pure Type Systems