Decision lists and related Boolean functions
From MaRDI portal
Recommendations
- Decision lists and related classes of Boolean functions
- On the computational power of Boolean decision lists
- scientific article; zbMATH DE number 2086400
- scientific article; zbMATH DE number 1051018
- scientific article; zbMATH DE number 512939
- Properties of Switch-List Representations of Boolean Functions
- Analysis of logical expressions of decision lists
- Enumerating Types of Boolean Functions
- A decomposition of Boolean functions
- Decomposition of Boolean functions
Cites work
- A theory of the learnable
- Combinatorial characterization of read-once formulae
- Complexity theoretic hardness results for query learning
- Decision lists and related Boolean functions
- Double Horn functions
- Error-free and best-fit extensions of partially defined Boolean functions
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Functions computed by monotone Boolean formulas with no repeated variables
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Horn Extensions of a Partially Defined Boolean Function
- scientific article; zbMATH DE number 3150820 (Why is no real title available?)
- scientific article; zbMATH DE number 3150821 (Why is no real title available?)
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 67797 (Why is no real title available?)
- scientific article; zbMATH DE number 1256690 (Why is no real title available?)
- scientific article; zbMATH DE number 1104330 (Why is no real title available?)
- scientific article; zbMATH DE number 1104344 (Why is no real title available?)
- scientific article; zbMATH DE number 219938 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Lower bounds on learning decision lists and trees
- On generating all maximal independent sets
- On specifying Boolean functions by labelled examples
- On the complexity of teaching
- On the Complexity of Timetable and Multicommodity Flow Problems
- Separatory sublattices and subsemilattices
- Teachability in computational learning
- Teaching a smarter learner.
- The Complexity of Enumeration and Reliability Problems
- The Complexity of Very Simple Boolean Formulas with Applications
Cited in
(16)- Dualization, decision lists and identification of monotone discrete functions
- Research note on decision lists
- Linear read-once and related Boolean functions
- Deciding atomicity of subword-closed languages
- Improved time complexities for learning Boolean networks
- Decision lists and related classes of Boolean functions
- scientific article; zbMATH DE number 3995386 (Why is no real title available?)
- No Efficient Disjunction or Conjunction of Switch-Lists
- Properties of Switch-List Representations of Boolean Functions
- Analysis of logical expressions of decision lists
- Monotone term decision lists
- Decision lists and related Boolean functions
- Deciding atomicity of subword-closed languages
- Version spaces and the consistency problem
- On the computational power of Boolean decision lists
- Measuring teachability using variants of the teaching dimension
This page was built for publication: Decision lists and related Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958318)
