706 search results - page 9 / 142 » On a quasi-ordering on Boolean functions |
EJC
2010
13 years 7 months ago
2010
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...
TCAD
1998
13 years 7 months ago
1998
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
RECOMB
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Since the first emergence of protein-protein interaction networks, more than a decade ago, they have been viewed as static scaffolds of the signaling-regulatory events ...
ASPDAC
1999
ACM
13 years 12 months ago
1999
ACM
—This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching. As ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...