Sciweavers

6 search results - page 1 / 2
» A Classification of Partial Boolean Clones
Sort
View
ISMVL
2010
IEEE
186views Hardware» more  ISMVL 2010»
14 years 3 months ago
A Classification of Partial Boolean Clones
We study intervals I(A) of partial clones whose total functions constitute a (total) clone A. In the Boolean case, we provide a complete classification of such intervals (accordin...
Dietlinde Lau, Karsten Schölzel
EJC
2010
13 years 11 months ago
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A determines a quasiorder on the set of all operations on A by the following rule: f is a C-minor of g if f can be obtained by substituting operati...
Erkko Lehtonen, Jaroslav Nesetril
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 10 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
CIE
2008
Springer
13 years 11 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
CP
2006
Springer
14 years 2 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh