I agree that this site is using cookies. You can find further informations here.
X
Čepek, Petr
24  results:
Search for persons X
?
1

The Valley of the Bees 

Arts & Culture;Culture & Society
Vlacil, Frantisek ; Korner, Vladimir ; Korner, Vladimir... , 2019
Link: http://www.socialismonfi..
 
?
2

Overcoming Long Inference Time of Nearest Neighbors Analysi..:

Koutenský, František ; Šimánek, Petr ; Čepek, Miroslav.
SN Computer Science.  5 (2024)  5 - p. , 2024
Link: https://doi.org/10.1007/..
 
?
3

Unique key Horn functions:

Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej..
Theoretical Computer Science.  922 (2022)  - p. 170-178 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Approximating Minimum Representations of Key Horn Functions:

Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej..
SIAM Journal on Computing.  51 (2022)  1 - p. 116-138 , 2022
Link: https://doi.org/10.1137/..
 
?
5

Generating clause sequences of a CNF formula:

Bérczi, Kristóf ; Boros, Endre ; Čepek, Ondřej...
Theoretical Computer Science.  856 (2021)  - p. 68-74 , 2021
Link: https://doi.org/10.1016/..
 
?
6

A decomposition method for CNF minimality proofs:

Boros, Endre ; Čepek, Ondřej ; Kučera, Petr
Theoretical Computer Science.  510 (2013)  - p. 111-126 , 2013
Link: https://doi.org/10.1016/..
 
?
7

Complexity issues related to propagation completeness:

Babka, Martin ; Balyo, Tomáš ; Čepek, Ondřej...
Artificial Intelligence.  203 (2013)  - p. 19-34 , 2013
Link: https://doi.org/10.1016/..
 
?
8

Boolean functions with long prime implicants:

Čepek, Ondřej ; Kučera, Petr ; Kuřík, Stanislav
Information Processing Letters.  113 (2013)  19-21 - p. 698-703 , 2013
Link: https://doi.org/10.1016/..
 
?
9

Boolean functions with a simple certificate for CNF complex..:

Čepek, Ondřej ; Kučera, Petr ; Savický, Petr
Discrete Applied Mathematics.  160 (2012)  4-5 - p. 365-382 , 2012
Link: https://doi.org/10.1016/..
 
?
10

Disjoint essential sets of implicates of a CQ Horn function:

Čepek, Ondřej ; Kučera, Petr
Annals of Mathematics and Artificial Intelligence.  61 (2011)  3 - p. 231-244 , 2011
Link: https://doi.org/10.1007/..
 
?
11

Analysing DNA microarray data using Boolean techniques:

Čepek, Ondřej ; Kronus, David ; Kučera, Petr
Annals of Operations Research.  188 (2010)  1 - p. 77-110 , 2010
Link: https://doi.org/10.1007/..
 
?
12

Exclusive and essential sets of implicates of Boolean funct..:

Boros, Endre ; Čepek, Ondřej ; Kogan, Alexander.
Discrete Applied Mathematics.  158 (2010)  2 - p. 81-96 , 2010
Link: https://doi.org/10.1016/..
 
?
13

A subclass of Horn CNFs optimally compressible in polynomia..:

Boros, Endre ; Čepek, Ondřej ; Kogan, Alexander.
Annals of Mathematics and Artificial Intelligence.  57 (2009)  3-4 - p. 249-291 , 2009
Link: https://doi.org/10.1007/..
 
?
14

Recognition of interval Boolean functions:

Čepek, Ondřej ; Kronus, David ; Kučera, Petr
Annals of Mathematics and Artificial Intelligence.  52 (2008)  1 - p. 1-24 , 2008
Link: https://doi.org/10.1007/..
 
?
15

Known and new classes of generalized Horn formulae with pol..:

Čepek, Ondřej ; Kučera, Petr
Discrete Applied Mathematics.  149 (2005)  1-3 - p. 14-52 , 2005
Link: https://doi.org/10.1016/..
 
1-15