A decomposition method for CNF minimality proofs.

@article{4062,
   author = {Boros, E. and Čepek, Ondřej and Kučera, Petr},
   language = {eng},
   issn = {0304-3975},
   journal = {Theoretical Computer Science},
   title = {A decomposition method for CNF minimality proofs.},
   url = {http://dl.acm.org/citation.cfm?id=2543019},
   volume = {Vol. 510},
   year = {2013}
}

TY  - JOUR
ID  - 4062
AU  - Boros, E. - Čepek, Ondřej - Kučera, Petr
PY  - 2013
TI  - A decomposition method for CNF minimality proofs.
JF  - Theoretical Computer Science
VL  - Vol. 510
SP  - pp. 111-126
EP  - pp. 111-126
PB  - Elsevier Science
SN  - 03043975
UR  - http://dl.acm.org/citation.cfm?id=2543019
ER  - 

BOROS, E., Ondřej ČEPEK and Petr KUČERA. A decomposition method for CNF minimality proofs. \textit{Theoretical Computer Science}. Elsevier Science, 2013, Vol. 510, p.~pp. 111-126. ISSN~0304-3975.