research
∙
01/30/2023
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
We consider the problem EnumIP of enumerating prime implicants of Boolea...
share
research
∙
12/23/2021
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
Bottom-up knowledge compilation is a paradigm for generating representat...
research
∙
10/25/2021
A Compilation of Succinctness Results for Arithmetic Circuits
Arithmetic circuits (AC) are circuits over the real numbers with 0/1-val...
research
∙
03/17/2021
Characterizing Tseitin-formulas with short regular resolution refutations
Tseitin-formulas are systems of parity constraints whose structure is de...
research
∙
01/06/2021
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Two major considerations when encoding pseudo-Boolean (PB) constraints i...
research
∙
11/27/2020
