Publication Records

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

ČEPEK, Ondřej, Petr KUČERA and S. KUŘÍK. Boolean functions with long prime implicants. Information Processing Letters. Elsevier Science, 2013, Vol. 113, Issues 19-21, p. pp. 698-703. ISSN 0020-0190.

BABKA, M., T. BALYO, Ondřej ČEPEK, Š. GURSKÝ, Petr KUČERA and V. VLČEK. Complexity issues related to propagation completeness. Artificial Intelligence. Elsevier Science, 2013, Vol. 203, p. pp. 19-34. ISSN 0004-3702.

BOROS, E., Ondřej ČEPEK and V. GURVICH. . Total tightness implies Nash-solvability for three-person gane forms. Discrete Mathematics. Elsevier Science, 2012, Vol. 312, Issue 1, p. pp. 1436-1443, 7 s. ISSN 0012-365X.

ČEPEK, Ondřej, Petr KUČERA and P. SAVICKÝ. Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics. Netherlands, 2012, Vol. 160, Issues 4-5, p. pp. 365-382. ISSN 0166-218X.

ČEPEK, Ondřej, Petr KUČERA and S. KUŘÍK. Boolean functions with long prime implicants. In Proceedings of International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, USA. 2012.

ČEPEK, Ondřej, Petr KUČERA and V. VLČEK. Properties of SLUR Formulae. Proceedings of SOFSEM 2012. In 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn. Springer Verlag, 2012, p. pp. 177-189. ISBN 978-3-642-27659-0.

ČEPEK, Ondřej, D. KRONUS and Petr KUČERA. Analysing DNA Microarray Data Using Boolean Techniques. Annals of Operations Research. Springer Verlag, 2011, Vol 188, No 1, p. pp. 77-110. ISSN 0254-5330.

ČEPEK, Ondřej and Petr KUČERA. Disjoint essential sets of implicates of a CQ Horn function. Annals of Mathematics and Artificial Intelligence. Springer Verlag, 2011, Vol. 61, No 3, p. 231-244, 13 s. ISSN 1012-2443.