A decomposability index in logical analysis of data
From MaRDI portal
Recommendations
Cites work
- An ejection chain approach for the generalized assignment problem
- Decomposability of partially defined Boolean functions
- Error-free and best-fit extensions of partially defined Boolean functions
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Logical analysis of data with decomposable structures.
- Logical analysis of numerical data
- Paths in graphs
- Positive and Horn decomposability of partially defined Boolean functions
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Threshold functions
Cited in
(5)- Recent advances in the theory and practice of logical analysis of data
- Logical analysis of data with decomposable structures.
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Logical analysis of data with decomposable structures
- An index for the data size to extract decomposable structures in LAD
This page was built for publication: A decomposability index in logical analysis of data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878410)