5 citations · 5 across the 4 of their papers we have counts for
6 papers
Generalized LIMDDs: Succinctness and Canonicity for Decision Diagrams Modulo a Group
Arend-Jan Quist, Alexis de Colnet, Thomas Reps +1
A reduced ordered decision diagram is the minimal automaton of a function on words of fixed length: its nodes are the residuals, and reduction is the Myhill--Nerode quotient. We st…
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
Alexis de Colnet, Floris Geerts, Rihan Hai +3
Strongly simulating a quantum circuit, that is, computing an output amplitude, can be done by summing the circuit's Feynman paths: a weighted count over assignments to Boolean path…
The Compilability Thresholds of 2-CNF to OBDD
Alexis de Colnet, Alfons Laarman, Joon Hyung Lee
We prove the existence of two thresholds regarding the compilability of random 2-CNF formulas to OBDDs. The formulas are drawn from , the uniform distribution…
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
Alexis de Colnet, Pierre Marquis
We consider the problem EnumIP of enumerating prime implicants of Boolean functions represented by decision decomposable negation normal form (dec-DNNF) circuits. We study EnumIP f…
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
Alexis de Colnet, Stefan Mengel
Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is…
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Alexis de Colnet
Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good…