Skip to main content
SpringerLink
Log in

On the learnability of DNF formulae

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 317))

Included in the following conference series:

Part of the work of the first author was done during a visit to the Dept. of Computer and System Science, University of Roma "La Sapienza", Roma Italy.

Work partially supported by the Italian project MPI "Analisi e progetto di algoritmi". The second author has been also partially supported by the EEC Esprit program within the KIWI project.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. A.Blumer,A.Ehrenfeucht,D.Haussler,M.Warmuth Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension Proc. 18th Acm Symposium on Theory of Computing (1986)

    Google Scholar 

  2. G.M.Benedek,A.Itai Non uniform learnability (These proceedings) (1988)

    Google Scholar 

  3. P.Berman,R.Roos Learning one-counter languages in polynomial time Proc. 28th Symposium on Foundations of Computer Science (1987)

    Google Scholar 

  4. A.Ehrenfeucht,D.Haussler,M.Kearns,L.Valiant A general lower bound on the number of examples needed for learning (to appear)

    Google Scholar 

  5. M.Kearns,M.Li,L.Pitt,L.G.Valiant On the learnability of boolean formulae Proc.19th Acm Symposium on Theory of Computing (1987)

    Google Scholar 

  6. N.Littlestone Learning quickly when irrelevant attributes abound: a new linear threshold algorithm Proc. 28th Symposium on Foundations of Computer Science (1987)

    Google Scholar 

  7. B.K.Natarajan On learning boolean functions Proc. 19th Symposium on Theory of Computing (1987)

    Google Scholar 

  8. L.G.Valiant A theory of learnable Comm.Acm, Vol.27,n.11 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics, Charles University, Prague, Czechoslovakia

    L. Kucera

  2. Dept. of Mathematics, University of L'Aquila, L'Aquila, Italy

    A. Marchetti-Spaccamela

  3. Dept. of Mathematics, University of Rome "Tor Vergata", Roma, Italy

    M. Protasi

Authors
  1. L. Kucera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Protasi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Timo Lepistö Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kucera, L., Marchetti-Spaccamela, A., Protasi, M. (1988). On the learnability of DNF formulae. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-19488-6_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19488-0

  • Online ISBN: 978-3-540-39291-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation