The DNF exception problem

DOI10.1016/j.tcs.2005.10.038zbMath1086.68113OpenAlexW1978315284MaRDI QIDQ818117

György Turán, Yi Zhao, Dhruv Mubayi

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.038

zbMATH Keywords

updatingdisjunctive normal formOccam algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)

Related Items (3)

Comparative analysis of the complexity of Boolean functions with a small number of zeros ⋮ Shortest and minimal disjunctive normal forms of complete functions ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms

Cites Work

• Sharpening Occam's razor
• Explicit representation of terms defined by counter examples
• Occam's razor
• On the necessity of Occam algorithms
• Malicious omissions and errors in answers to membership queries
• Implementation of a class of Boolean functions with a small number of zeros by irredundant disjunctive normal forms
• Disjunctive normal forms of Boolean functions with a small number of zeros
• On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros
• Matroids and a Reliability Analysis Problem
• Exact learning of DNF formulas using DNF hypotheses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The DNF exception problem