Výpis publikací

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

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

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

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

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

ČEPEK, Ondřej, Petr KUČERA a 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 a 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, s. pp. 177-189. ISBN 978-3-642-27659-0.

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

ČEPEK, Ondřej a 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, s. 231-244, 13 s. ISSN 1012-2443.