Sciweavers

DAC
1993
ACM
13 years 9 months ago
Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping
The Walsh transform has numerous applications in computer-aided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions th...
Edmund M. Clarke, Kenneth L. McMillan, Xudong Zhao...
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
13 years 9 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm
ICCAD
1996
IEEE
123views Hardware» more  ICCAD 1996»
13 years 9 months ago
Efficient solution of systems of Boolean equations
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
Scott Woods, Giorgio Casinovi
STACS
1998
Springer
13 years 9 months ago
On Disguised Double Horn Functions and Extensions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
SACRYPT
1998
Springer
13 years 9 months ago
The Nonhomomorphicity of Boolean Functions
Abstract. We introduce the notion of nonhomomorphicity as an alternative criterion that forecasts nonlinear characteristics of a Boolean function. Although both nonhomomorphicity a...
Xian-Mo Zhang, Yuliang Zheng
MFCS
1998
Springer
13 years 9 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav
ACISP
1999
Springer
13 years 9 months ago
On the Symmetric Property of Homogeneous Boolean Functions
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...
Chengxin Qu, Jennifer Seberry, Josef Pieprzyk
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
13 years 9 months ago
A Theorem on Sensitivity and Applications in Private Computation
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
Anna Gál, Adi Rosén
ASPDAC
1999
ACM
101views Hardware» more  ASPDAC 1999»
13 years 9 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