 | 2012 |
| 11 |  | Ondrej Cepek,
Petr Kucera,
Stanislav Kurik:
Boolean functions with long prime implicants.
ISAIM 2012 |
| 10 |  | Václav Vlcek,
T. Balyo,
S. Gurský,
Petr Kucera:
On hierarchies over the SLUR class.
ISAIM 2012 |
| 9 |  | Ondrej Cepek,
Petr Kucera,
Václav Vlcek:
Properties of SLUR Formulae.
SOFSEM 2012: 177-189 |
| 8 |  | Ondrej Cepek,
Petr Kucera,
Petr Savický:
Boolean functions with a simple certificate for CNF complexity.
Discrete Applied Mathematics 160(4-5): 365-382 (2012) |
| 2011 |
| 7 |  | Ondrej Cepek,
Petr Kucera:
Disjoint essential sets of implicates of a CQ Horn function.
Ann. Math. Artif. Intell. 61(3): 231-244 (2011) |
| 6 |  | Ondrej Cepek,
David Kronus,
Petr Kucera:
Analysing DNA microarray data using Boolean techniques.
Annals OR 188(1): 77-110 (2011) |
| 2010 |
| 5 |  | Endre Boros,
Ondrej Cepek,
Alexander Kogan,
Petr Kucera:
Exclusive and essential sets of implicates of Boolean functions.
Discrete Applied Mathematics 158(2): 81-96 (2010) |
| 2009 |
| 4 |  | Endre Boros,
Ondrej Cepek,
Alexander Kogan,
Petr Kucera:
A subclass of Horn CNFs optimally compressible in polynomial time.
Ann. Math. Artif. Intell. 57(3-4): 249-291 (2009) |
| 2008 |
| 3 |  | Ondrej Cepek,
David Kronus,
Petr Kucera:
Recognition of interval Boolean functions.
Ann. Math. Artif. Intell. 52(1): 1-24 (2008) |
| 2005 |
| 2 |  | Petr Kucera:
On the size of maximum renamable Horn sub-CNF.
Discrete Applied Mathematics 149(1-3): 126-130 (2005) |
| 1 |  | Ondrej Cepek,
Petr Kucera:
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing.
Discrete Applied Mathematics 149(1-3): 14-52 (2005) |