On the topology of algorithms, I
Journal of Complexity
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
A note on a P ≠ NP result for a restricted class of real machines
Journal of Complexity
Point location in arrangements of hyperplanes
Information and Computation
On decision trees for orthants
Information Processing Letters
Complexity and real computation
Complexity and real computation
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
Topological complexity of the range searching
Journal of Complexity
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Complexity of Factors of Multivariate Polynomials
Foundations of Computational Mathematics
The Complexity of Polynomials and Their Coefficient Functions
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
VPSPACE and a transfer theorem over the reals
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
VPSPACE and a transfer theorem over the complex field
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
This is a survey of some of my joint work with Sylvain Périfel. It is focused on transfer theorems that connect boolean complexity to algebraic complexity in the Valiant and Blum-Shub-Smale models.