Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

STOC
1987
ACM

52views Algorithms» more STOC 1987»

On the Learnability of Boolean Formulae

15 years 10 months ago

On the Learnability of Boolean Formulae

Download www.cis.upenn.edu

Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G

Real-time Traffic

Algorithms | STOC 1987 |

claim paper

Related Content

» Kernel Machines and Boolean Functions

» Learning Probabilistic ReadOnce Formulas on Product Distributions

» Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas

» On Models for Quantified Boolean Formulas

» Separating Quantum and Classical Learning

» Resource Bounded Measure and Learnability

» Limiting Negations in Formulas

» On RestrictedFocusofAttention Learnability of Boolean Functions

» The Boolean Formula Value Problem Is in ALOGTIME

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	STOC
Authors	Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant

Comments (0)