Amanote Research

Amanote Research

    RegisterSign 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 YangAvrim BlumJaime Carbonell
Publisher

ACM Press


Related search

Disjoint DNF Tautologies With Conflict Bound Two

Journal on Satisfiability, Boolean Modeling and Computation
2007English

Robustifying Learnability

Journal of Economic Dynamics and Control
ControlApplied MathematicsOptimizationEconometricsEconomics
2009English

The Complexity of DNF of Parities

2016English

Learnability of Constrained Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Queries With Guarded Negation

Proceedings of the VLDB Endowment
Computer Science
2012English

Using Domain-Specific Data to Enhance Scientific Workflow Steering Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On the Learnability of Implicit Arguments

Language Acquisition and Language Disorders
DevelopmentalEducational PsychologyLanguageLinguisticsHearingSpeech
2019English

Learnability and Rationality of Choice

Journal of Economic Theory
EconomicsEconometrics
2003English

Complexity Dimensions and Learnability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy