### Abstract

Based on the uniform distribution PAC learning model, the learnability for the class of monotone disjunctive normal form formulas with at most O (log n) terms, denoted O (log n)-term MDNF, is investigated. Using the technique of restriction, an algorithm that learns O (log n)-term MDNF by examples in polynomial time is given.

Original language | English |
---|---|

Pages (from-to) | 17-33 |

Number of pages | 17 |

Journal | Theory of Computing Systems |

Volume | 33 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2000 Jan 1 |

Externally published | Yes |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'Learning monotone log-term DNF formulas under the uniform distribution'. Together they form a unique fingerprint.

## Cite this

Sakai, Y., & Maruoka, A. (2000). Learning monotone log-term DNF formulas under the uniform distribution.

*Theory of Computing Systems*,*33*(1), 17-33. https://doi.org/10.1007/s002249910002