40 citations · 64 across the 27 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
ALLSAT compressed with wildcards: An invitation for C-programmers
Marcel Wild
The model set of a general Boolean function in CNF is calculated in a compressed format, using novel wildcards. This method can be explained in very visual ways. Preliminary compar…
cs.DS2017
An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes
Marcel Wild
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideal…
cs.DS2017★ 1 cited
Compression with wildcards: All k-models of a binary decision diagram
Marcel Wild, Yves Semegni
Given a Binary Decision Diagram of a Boolean function in variables, it is well known that all -models can be enumerated in output polynomial time, and in a compresse…