290 search results - page 4 / 58 » Lattice-based computation of Boolean functions |
100
Voted
ASPDAC
1999
ACM
15 years 7 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 ...
140
Voted
JACIII
2007
15 years 3 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
96
Voted
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
117
Voted
PDP
1995
IEEE
15 years 7 months ago
1995
IEEE
107
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...