Amanote Research
Register
Sign In
Learnability of DNF With Representation-Specific Queries
doi 10.1145/2422436.2422441
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2013
Authors
Liu Yang
Avrim Blum
Jaime Carbonell
Publisher
ACM Press
Related search
Disjoint DNF Tautologies With Conflict Bound Two
Journal on Satisfiability, Boolean Modeling and Computation
Robustifying Learnability
Journal of Economic Dynamics and Control
Control
Applied Mathematics
Optimization
Econometrics
Economics
The Complexity of DNF of Parities
Learnability of Constrained Logic Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Queries With Guarded Negation
Proceedings of the VLDB Endowment
Computer Science
Using Domain-Specific Data to Enhance Scientific Workflow Steering Queries
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Learnability of Implicit Arguments
Language Acquisition and Language Disorders
Developmental
Educational Psychology
Language
Linguistics
Hearing
Speech
Learnability and Rationality of Choice
Journal of Economic Theory
Economics
Econometrics
Complexity Dimensions and Learnability
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science