Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
On the Learnability of Disjunctive Normal Form Formulas
Howard Aizenstein, Leonard Pitt
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the Learnability of Disjunctive Normal Form Formulas'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Learnability
100%
Disjunctive Normal Form
100%
Exponential Time
15%
Hardness Results
15%
Learning Theory
7%
Polynomial Time
7%
Polynomial-time Algorithm
7%
Learning Algorithm
7%
Natural Approach
7%
Monotone
7%
Boolean Functions
7%
Valiant
7%
Hidden Functions
7%
Prime Implicants
7%
Mathematics
Form Formula
100%
Polynomial Time
28%
Counterexample
28%
Exponential Time
28%
Boolean Function
14%
Related Result
14%
Seminal Paper
14%
Computer Science
Disjunctive Normal Form
100%
Polynomial Time
7%
Polynomial Time Algorithm
7%
Learning Algorithm
7%
Boolean Function
7%