| Publication | Date of Publication | Type |
|---|
On CNF formulas irredundant with respect to unit clause propagation
Theoretical Computer Science | 2026-01-14 | Paper |
On sparse parity check matrices (extended abstract)
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Propagation complete encodings of smooth DNNF theories
Constraints | 2022-09-29 | Paper |
Bounds on the size of PC and URC formulas
Journal of Artificial Intelligence Research | 2021-01-22 | Paper |
Optimal classification trees
COMPSTAT | 2020-07-21 | Paper |
Optimally trained regression trees and Occam's razor
Compstat | 2020-07-15 | Paper |
A lower bound on CNF encodings of the at-most-one constraint
Theoretical Computer Science | 2019-02-28 | Paper |
Quasi-periodic \(\beta\)-expansions and cut languages
Theoretical Computer Science | 2018-03-12 | Paper |
A lower bound on CNF encodings of the at-most-one constraint
Lecture Notes in Computer Science | 2017-11-15 | Paper |
Cut languages in rational bases
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Generating models of a matched formula with a polynomial delay
Journal of Artificial Intelligence Research | 2016-07-05 | Paper |
Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
Theoretical Computer Science | 2016-05-02 | Paper |
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics | 2012-05-04 | Paper |
Remarks on Gödel's code as a hash function
Tatra Mountains Mathematical Publications | 2011-02-17 | Paper |
Some typical properties of large AND/OR Boolean formulas
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Triangulation Heuristics for BN2O Networks
Lecture Notes in Computer Science | 2009-07-02 | Paper |
Distinguishing standard SBL-algebras with involutive negations by propositional formulas
Mathematical Logic Quarterly | 2008-12-10 | Paper |
| scientific article; zbMATH DE number 5269047 (Why is no real title available?) | 2008-04-29 | Paper |
| scientific article; zbMATH DE number 5269047 (Why is no real title available?) | 2008-04-29 | Paper |
On Product Logic with Truth-constants
Journal Of Logic And Computation | 2006-07-03 | Paper |
On the influence of the variable ordering for algorithmic learning using OBDDs
Information and Computation | 2005-10-10 | Paper |
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 2077136 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1759451 (Why is no real title available?) | 2002-11-04 | Paper |
| On random orderings of variables for parity ordered binary decision diagrams | 2001-01-14 | Paper |
On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
Computational Complexity | 2000-11-20 | Paper |
DNF tautologies with a limited number of occurrences of every variable
Theoretical Computer Science | 2000-08-21 | Paper |
A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
Theoretical Computer Science | 2000-08-21 | Paper |
| The number of Boolean functions computed by formulas of a given size | 1999-12-19 | Paper |
| scientific article; zbMATH DE number 1361490 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1361505 (Why is no real title available?) | 1999-11-10 | Paper |
Complexity and Probability of Some Boolean Formulas
Combinatorics, Probability and Computing | 1999-04-13 | Paper |
On sparse parity check matrices
Designs, Codes and Cryptography | 1998-12-13 | Paper |
A lower bound on branching programs reading some bits twice
Theoretical Computer Science | 1998-07-23 | Paper |
Efficient algorithms for the transformation between different types of binary decision diagrams
Acta Informatica | 1997-12-08 | Paper |
| Some typical properties of large AND/OR Boolean formulas | 1997-11-02 | Paper |
Bent functions and random Boolean formulas
Discrete Mathematics | 1996-03-24 | Paper |
Improved boolean formulas for the Ramsey graphs
Random Structures & Algorithms | 1995-10-31 | Paper |
On the bent Boolean functions that are symmetric
European Journal of Combinatorics | 1994-10-09 | Paper |
On shifting networks
Theoretical Computer Science | 1993-10-17 | Paper |
One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
SIAM Journal on Computing | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4209213 (Why is no real title available?) | 1991-01-01 | Paper |
Random Boolean formulas representing any Boolean function with asymptotically equal probability
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4061157 (Why is no real title available?) | 1988-01-01 | Paper |
Graph complexity
Acta Informatica | 1988-01-01 | Paper |
On CNF formulas irredundant with respect to unit clause propagation
(available as arXiv preprint) | N/A | Paper |
