Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Real computations with fake numbers
Journal of Complexity
There Are No Sparse NPW-Hard Sets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Relativizations of the P =? NP Question for Several Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
On Ladner's result for a class of real machines with restricted use of constants
Information and Computation
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
On the approximation of interval functions
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.00 |