| A subclass of Horn CNFs optimally compressible in polynomial time E Boros, O Čepek, A Kogan, P Kučera Annals of mathematics and artificial intelligence 57, 249-291, 2009 | 29 | 2009 |
| Properties of SLUR formulae O Čepek, P Kučera, V Vlček SOFSEM 2012: Theory and Practice of Computer Science: 38th Conference on …, 2012 | 22 | 2012 |
| Exclusive and essential sets of implicates of Boolean functions E Boros, O Čepek, A Kogan, P Kučera Discrete Applied Mathematics 158 (2), 81-96, 2010 | 22 | 2010 |
| Complexity issues related to propagation completeness M Babka, T Balyo, O Čepek, Š Gurský, P Kučera, V Vlček Artificial Intelligence 203, 19-34, 2013 | 20 | 2013 |
| A decomposition method for CNF minimality proofs E Boros, O Čepek, P Kučera Theoretical Computer Science 510, 111-126, 2013 | 19 | 2013 |
| Boolean functions with a simple certificate for CNF complexity P Kučera, P Savický Discrete Applied Mathematics 160 (4-5), 365-382, 2012 | 15 | 2012 |
| Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing O Čepek, P Kučera Discrete Applied Mathematics 149 (1-3), 14-52, 2005 | 13 | 2005 |
| Recognition of interval Boolean functions O Čepek, D Kronus, P Kučera Annals of Mathematics and Artificial Intelligence 52 (1), 1-24, 2008 | 12 | 2008 |
| A lower bound on CNF encodings of the at-most-one constraint P Kučera, P Savický, V Vorel Theoretical Computer Science 762, 51-73, 2019 | 11 | 2019 |
| On hierarchies over the SLUR class T Balyo, Š Gurský, P Kucera, V Vlcek Twelfth International Symposium on Artificial Intelligence and Mathematics …, 2012 | 10 | 2012 |
| On the complexity of minimizing the number of literals in Horn formulae O Cepek, P Kucera MIS 2004, 3, 2008 | 9 | 2008 |
| Propagation complete encodings of smooth DNNF theories P Kučera, P Savický Constraints 27 (3), 327-359, 2022 | 8 | 2022 |
| Hydras: Complexity on general graphs and a subclass of trees P Kučera Theoretical Computer Science 658, 399-416, 2017 | 7 | 2017 |
| Approximating Minimum Representations of Key Horn Functions K Bérczi, E Boros, O Čepek, P Kučera, K Makino SIAM Journal on Computing 51 (1), 116-138, 2022 | 6 | 2022 |
| Boolean functions with long prime implicants O Čepek, P Kučera, S Kuřík Information Processing Letters 113 (19-21), 698-703, 2013 | 6 | 2013 |
| Bounds on the size of PC and URC formulas P Kučera, P Savický Journal of Artificial Intelligence Research 69, 1395-1420, 2020 | 5 | 2020 |
| Backdoor decomposable monotone circuits and propagation complete encodings P Kučera, P Savický Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3832-3840, 2021 | 3 | 2021 |
| Unique key Horn functions K Bérczi, E Boros, O Čepek, P Kučera, K Makino Theoretical Computer Science 922, 170-178, 2022 | 2 | 2022 |
| Generating clause sequences of a CNF formula K Bérczi, E Boros, O Čepek, K Elbassioni, P Kučera, K Makino Theoretical computer science 856, 68-74, 2021 | 2 | 2021 |
| Backdoor decomposable monotone circuits and their propagation complete encodings P Kučera, P Savický arXiv preprint arXiv:1811.09435, 2018 | 2 | 2018 |
Endre BorosDistinguished Professor, MSIS Department, Rutgers University在 rutgers.edu 的电子邮件经过验证
