Sciweavers

4255 search results - page 15 / 851
» On Learning Boolean Functions
Sort
View
ASPDAC
1999
ACM
101views Hardware» more  ASPDAC 1999»
13 years 12 months ago
Fast Boolean Matching Under Permutation Using Representative
—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 ...
Debatosh Debnath, Tsutomu Sasao
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Sensitivity of Cyclically-Invariant Boolean Functions
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
Sourav Chakraborty
EIT
2008
IEEE
14 years 2 months ago
Relating Boolean gate truth tables to one-way functions
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
Mahadevan Gomathisankaran, Akhilesh Tyagi
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 2 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
INDOCRYPT
2004
Springer
14 years 1 months ago
On Boolean Functions with Generalized Cryptographic Properties
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a bett...
An Braeken, Ventzislav Nikov, Svetla Nikova, Bart ...