Learning Binary Relations and Total Orders
- 1 October 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (5) , 1006-1034
- https://doi.org/10.1137/0222062
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The Weighted Majority AlgorithmInformation and Computation, 1994
- Equivalence of models for polynomial learnabilityInformation and Computation, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Approximating the PermanentSIAM Journal on Computing, 1989
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold AlgorithmMachine Learning, 1988
- Queries and Concept LearningMachine Learning, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Balancing poset extensionsOrder, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979