On the topology of algorithms, I
Journal of Complexity
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
Test complexity of generic polynomials
Journal of Complexity
A note on a P ≠ NP result for a restricted class of real machines
Journal of Complexity
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Point location in arrangements of hyperplanes
Information and Computation
Computing over the reals with addition and order
Selected papers of the workshop on Continuous algorithms and complexity
Accessible telephone directories
Journal of Symbolic Logic
Computing over the reals with addition and order: higher complexity classes
Journal of Complexity
A weak version of the Blum, Shub, and Smale model
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Complexity and real computation
Complexity and real computation
On Parallel Computation for the Knapsack Problem
Journal of the ACM (JACM)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds Are Not Easier over the Reals: Inside PH
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Where are the hard knapsack problems?
Computers and Operations Research
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |