Relations between threshold and \(k\)-interval Boolean functions
From MaRDI portal
Publication:646713
DOI10.1007/s10479-010-0786-yzbMath1238.94041OpenAlexW1986094244MaRDI QIDQ646713
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0786-y
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Recognition of interval Boolean functions
- Horn minimization by iterative decomposition
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Simple games on closure spaces
- Computing the minimum DNF representation of Boolean functions defined by intervals
- Discrete Mathematics of Neural Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relations between threshold and \(k\)-interval Boolean functions
