707 search results - page 41 / 142 » The Nonhomomorphicity of Boolean Functions |
ITA
2000
13 years 7 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
ISMVL
2008
IEEE
14 years 2 months ago
2008
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
JCT
2010
13 years 6 months ago
2010
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...