290 search results - page 1 / 58 » Lattice-based computation of Boolean functions |
103
click to vote
BIRTHDAY
2004
Springer
15 years 1 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
ICFCA
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Standard Support Vector Machines (SVM) text classification relies on bag-of-words kernel to express the similarity between documents. We show that a document lattice can ...
67
Voted
DAC
2010
ACM
15 years 1 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
89
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
85
Voted
AMC
2006
14 years 9 months ago
2006
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...