4255 search results - page 11 / 851 » On Learning Boolean Functions |
122
Voted
AI
1999
Springer
15 years 1 months ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
COCO
1991
Springer
15 years 5 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
DAC
2010
ACM
15 years 5 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...
163
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
125
click to vote
IACR
2011
14 years 1 months ago
2011
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...