4255 search results - page 42 / 851 » On Learning Boolean Functions |
VLSID
2004
IEEE
14 years 8 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
ML
1998
ACM
13 years 7 months ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...