Decision lists and related Boolean functions

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 493-524

  Eiter, Thomas ^a   Ibaraki, Toshihide ^b   Makino, Kazuhisa ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b KYOTO UNIVERSITY   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

Boolean functions; Decision lists; Extension problem; Polynomial delay enumeration; Teaching sequence

Indexed keywords

ALGORITHMS; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING;

DECISION LISTS; POLYNOMIAL DEALY ENUMERATION;

BOOLEAN FUNCTIONS;

EID: 0037028457     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00003-2     Document Type: Article

References (39)

1. Complexity theoretic hardness results for query learning
2. Read-thrice DNF is hard to learn with membership and equivalence queries
3. Threshold functions, decision lists and neural networks
4. On specifying Boolean functions by labelled examples
5. Error-free and best-fit extensions of partially defined Boolean functions
6. Cause-effect relationships and partially defined Boolean functions
7. PAC learning with irrelevant attributes
8. Partial Occam's razor and its applications
9. Linear-time algorithms for testing the satisfiability of propositional Horn theories
10. Exact transversal hypergraphs and application to Boolean μ-functions
11. Multi-face Horn functions
12. Double Horn functions
13. On the complexity of timetable and multicommodity flow problems
14. On the complexity of teaching
15. Teaching a smarter learner
16. Criteria for repetition-freeness of functions in the algebra of logic
17. Lower bounds on learning decision lists and trees
18. On the geometric separability of Boolean functions
19. Learning nested differences of intersection-closed concept classes
20. The complexity of very simple Boolean formulas with applications
21. A computational model of teaching
22. On generating all maximal independent sets
23. Combinatorial characterization of read-once formulae
24. On repetition-free contact schemes and repetition-free superpositions of the functions in the algebra of logic
25. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms
26. Separatory sublattices and subsemilattices
27. Learning when irrelevant attributes abound: A new linear threshold algorithm
28. Horn extensions of a partially defined Boolean function
29. Functions computed by monotone Boolean formulas with no repeated variables
30. Induction of decision trees
31. Learning decision lists
32. Learning with a helpful teacher
33. Teachability in computational learning
34. On the theory of repetition-free contact schemes
35. The complexity of enumeration and reliability problems
36. A theory of the learnable