Learning in parallel

DOI10.1016/0890-5401(92)90047-JzbMath0766.68116MaRDI QIDQ1187024

Jyh-Han Lin, Jeffrey Scott Vitter

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

concept learning\({\mathcal {NC}}\)-learnableparallel learning models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions ⋮ Noise-tolerant parallel learning of geometric concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Occam's razor
• Equivalence of models for polynomial learnability
• Approximation algorithms for combinatorial problems
• Linear programming is log-space hard for P
• Simulation of Parallel Random Access Machines by Circuits
• Parity, circuits, and the polynomial-time hierarchy
• Constant Depth Reducibility
• Learnability and the Vapnik-Chervonenkis dimension
• A taxonomy of problems with fast parallel algorithms
• A theory of the learnable
• A Greedy Heuristic for the Set-Covering Problem
• The complexity of linear programming

This page was built for publication: Learning in parallel