Sciweavers

707 search results - page 58 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
TVLSI
1998
124views more  TVLSI 1998»
13 years 7 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
DAC
2009
ACM
14 years 9 months ago
BDD-based synthesis of reversible logic for large functions
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
Robert Wille, Rolf Drechsler
ALT
2004
Springer
14 years 5 months ago
Learning r-of-k Functions by Boosting
We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r o...
Kohei Hatano, Osamu Watanabe
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
14 years 1 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir
DAC
2006
ACM
14 years 9 months ago
Topology aware mapping of logic functions onto nanowire-based crossbar architectures
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...
Wenjing Rao, Alex Orailoglu, Ramesh Karri