Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Discontinuities in recurrent neural networks
Neural Computation
Transfer theorems via sign conditions
Information Processing Letters
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
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Straight-line programs and torsion points on elliptic curves
Computational Complexity
A measure of space for computing over the reals
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Exotic quantifiers, complexity classes, and complete problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |