- A subclass of Horn CNFs optimally compressible in polynomial time2010 | Faculty of Mathematics and Physics
- On the size of maximum renamable Horn sub-CNF2005 | Faculty of Mathematics and Physics
- Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization2014 | Faculty of Mathematics and Physics
- Boolean functions with a simple certificate for CNF complexity2012 | Faculty of Mathematics and Physics
- Generating clause sequences of a CNF formula2021 | Faculty of Mathematics and Physics
- A decomposition method for CNF minimality proofs2013 | Faculty of Mathematics and Physics
- A Lower Bound on CNF Encodings of the At-Most-One Constraint2017 | Faculty of Mathematics and Physics
- A lower bound on CNF encodings of the at-most-one constraint2019 | Faculty of Mathematics and Physics
- On the size of CNF formulas with high propagation strength2020 | Faculty of Mathematics and Physics
- Properties of SLUR Formulae2012 | Faculty of Mathematics and Physics
- On Hierarchies over the SLUR Class2012 | Faculty of Mathematics and Physics
- Disjoint essential sets of implicates of a CQ Horn function2011 | Faculty of Mathematics and Physics
- Disjoint essential sets of implicates of a CQ Horn function.2009 | Faculty of Mathematics and Physics
- Hydras: Complexity on general graphs and a subclass of trees2017 | Faculty of Mathematics and Physics
- Cellulose Mesh with Charged Nanocellulose Coatings as a Promising Carrier of Skin and Stem Cells for Regenerative Applications2020 | First Faculty of Medicine, Faculty of Physical Education and Sport
- Complexity Issues Related to Propagation Completeness2013 | Faculty of Mathematics and Physics
- On Minimum Representations of Matched Formulas (Extended Abstract)2017 | Faculty of Mathematics and Physics
- On Minimum Representations of Matched Formulas2014 | Faculty of Mathematics and Physics
- On Hierarchies over the Class of SLUR Formulae2011 | Faculty of Mathematics and Physics
- On the gap between the complexity of SAT and minimization for certain classes of boolean formulas2014 | Faculty of Mathematics and Physics
- Strong Duality in Horn Minimization2017 | Faculty of Mathematics and Physics
- Learning a Propagation Complete Formula2022 | Faculty of Mathematics and Physics
- Flexible, ultrathin and light films from one-dimensional nanostructures of polypyrrole and cellulose nanofibers for high performance electromagnetic interference shielding2023 | Faculty of Mathematics and Physics
- On Proof Complexity of Resolution over Polynomial Calculus2022 | Faculty of Mathematics and Physics
- Switch lists in the landscape of knowledge representations languages2022 | Faculty of Mathematics and Physics
- Solving difficult SAT instances using greedy clique decomposition2007 | Faculty of Mathematics and Physics
- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)2014 | Faculty of Mathematics and Physics
- Solving Difficult SAT Instances Using Greedy Clique Decomposition2007 | Faculty of Mathematics and Physics
- Knowledge compilation and compression using interval representations2015 | Faculty of Mathematics and Physics
- Knowledge compilation from DNF to switch-list representations2016 | Faculty of Mathematics and Physics