ALLSAT compressed with wildcards. Part 4: An invitation for C-programmers

12/03/2017
by   Marcel Wild, et al.
0

The model set of a general Boolean function in CNF is calculated in a compressed format, using wildcards. This novel method can be explained in very visual ways. Preliminary comparison with existing methods (BDD's and ESOPs) looks promising but our algorithm begs for a C encoding which would render it comparable in more systematic ways.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2018

On Computing Average Common Substring Over Run Length Encoded Sequences

The Average Common Substring (ACS) is a popular alignment-free distance ...
research
07/13/2020

Local Editing in LZ-End Compressed Data

This paper presents an algorithm for the modification of data compressed...
research
12/20/2019

Distributed Fixed Point Methods with Compressed Iterates

We propose basic and natural assumptions under which iterative optimizat...
research
02/09/2014

Direct Processing of Run Length Compressed Document Image for Segmentation and Characterization of a Specified Block

Extracting a block of interest referred to as segmenting a specified blo...
research
06/05/2020

Can the Multi-Incoming Smart Meter Compressed Streams be Re-Compressed?

Smart meters have currently attracted attention because of their high ef...
research
12/05/2017

Tensor Approximation of Advanced Metrics for Sensitivity Analysis

Following up on the success of the analysis of variance (ANOVA) decompos...

Please sign up or login with your details

Forgot password? Click here to reset