707 search results - page 59 / 142 » The Nonhomomorphicity of Boolean Functions |
DAC
2006
ACM
14 years 9 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
GLVLSI
2007
IEEE
14 years 2 months ago
2007
IEEE
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
FOCS
2002
IEEE
14 years 29 days ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
STACS
1998
Springer
14 years 6 days ago
1998
Springer
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
DELTA
2002
IEEE
14 years 29 days ago
2002
IEEE
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...