Sciweavers

707 search results - page 38 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
JCT
2006
87views more  JCT 2006»
13 years 8 months ago
Construction of bent functions via Niho power functions
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of ...
Hans Dobbertin, Gregor Leander, Anne Canteaut, Cla...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 6 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
AMC
2006
125views more  AMC 2006»
13 years 8 months ago
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Seref Mirasyedioglu, Tolga Güyer
STOC
1999
ACM
85views Algorithms» more  STOC 1999»
14 years 7 days 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
APPROX
2011
Springer
249views Algorithms» more  APPROX 2011»
12 years 8 months ago
A Canonical Form for Testing Boolean Function Properties
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
Dana Dachman-Soled, Rocco A. Servedio