the problem of series two-block disjoint decomposition of completely specifiedboolean functions is considered. analysis and investigation of such systems are veryimportant in logical design context. recently, a good method for solving thisproblem was suggested which has been based on the ternary matrix cover approach.using this method a computer program was developed. this paper is focused onde...

We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic regionbased locking scheme with only a fraction of the memory requirements of a regular hash table.

In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator for table constraints in or-tools and OscaR, two publicly available CP solvers, it has never been described so far. Importantly, CT has been recently improved further with the introduction of residues, resetting o...

The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied. 1. Presentation of the problem 1.1. Informal description and examples In several fields, it can be helpful to give a compa...

Table constraints are very useful for modeling combinatorial constrained problems, and thus play an important role in Constraint Programming (CP). During the last decade, many algorithms have been proposed for enforcing the property known as Generalized Arc Consistency (GAC) on such constraints. A state-of-the art GAC algorithm called CompactTable (CT), which has been recently proposed, signifi...