On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Transfer theorems via sign conditions
Information Processing Letters
Real computations with fake numbers
Journal of Complexity
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
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
An explicit solution to Post's Problem over the reals
Journal of Complexity
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Uncomputability below the real halting problem
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Exotic quantifiers, complexity classes, and complete problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |