Skip to main content
SpringerLink
Log in

Learning Monotone Log-Term DNF Formulas under the Uniform Distribution

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences, Faculty of Engineering, Toyo University, 2100 Kujirai, Kawagoe 350-8585, Japan sakai@cs.toyo.ac.jp , , , , , , JP

    Y. Sakai

  2. Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan maruoka@ecei.tohoku.ac.jp, , , , , , JP

    A. Maruoka

Authors
  1. Y. Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Maruoka
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 2, 1998, and in revised form April 8, 1999, and in final form June 30, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sakai, Y., Maruoka, A. Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. Theory Comput. Systems 33, 17–33 (2000). https://doi.org/10.1007/s002249910002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002249910002

Keywords

Search

Navigation