Computing minimal sets of descriptive conditions for binary data

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F14%3A33150666" target="_blank" >RIV/61989592:15310/14:33150666 - isvavai.cz</a>
Result on the web
<a href="http://www.tandfonline.com/doi/abs/10.1080/03081079.2014.885166#.VK0CKSvF-AU" target="_blank" >http://www.tandfonline.com/doi/abs/10.1080/03081079.2014.885166#.VK0CKSvF-AU</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/03081079.2014.885166" target="_blank" >10.1080/03081079.2014.885166</a>

Result language
angličtina
Original language name
Computing minimal sets of descriptive conditions for binary data
Original language description
We present a problem of computing descriptive conditions from binary data and propose an approximation algorithm for it.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Result description