706 search results - page 47 / 142 » On a quasi-ordering on Boolean functions |
151
click to vote
ERSHOV
2003
Springer
15 years 11 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
175
click to vote
NIPS
2001
15 years 7 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
149
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
160
click to vote
FFA
2008
15 years 6 months ago
2008
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...
169
click to vote
GLVLSI
2007
IEEE
16 years 18 days ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...