Sciweavers

4255 search results - page 53 / 851
» On Learning Boolean Functions
Sort
View
DAC
2005
ACM
15 years 10 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
COCO
2007
Springer
92views Algorithms» more  COCO 2007»
15 years 4 months ago
Halfspace Matrices
A halfspace matrix is a Boolean matrix A with rows indexed by linear threshold functions f, columns indexed by inputs x ∈ {−1,1}n, and the entries given by Af,x = f(x). We dem...
Alexander A. Sherstov
CRYPTO
2004
Springer
154views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators
Abstract. In this paper we propose a new key recovery attack on irregular clocked keystream generators where the stream is filtered by a nonlinear Boolean function. We show that t...
Håvard Molland, Tor Helleseth
TOC
2010
142views Management» more  TOC 2010»
14 years 4 months ago
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
Homin K. Lee
JSAT
2006
88views more  JSAT 2006»
14 years 9 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva