Simulating probabilistic by deterministic algebraic computation trees
Theoretical Computer Science
Structural complexity 1
Journal of Symbolic Computation
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
On randomized semi-algebraic test complexity
Journal of Complexity
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Feedforward nets for interpolation and classification
Journal of Computer and System Sciences
Separation of complexity classes in Koiran's weak model
Selected papers of the workshop on Continuous algorithms and complexity
Computing over the reals with addition and order
Selected papers of the workshop on Continuous algorithms and complexity
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing over the reals with addition and order: higher complexity classes
Journal of Complexity
Polynomial bounds for VC dimension of sigmoidal neural networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Real computations with fake numbers
Journal of Complexity
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
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistically Checkable Proofs Over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |