707 search results - page 113 / 142 » The Nonhomomorphicity of Boolean Functions |
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
ECCC
2007
13 years 7 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...