Sciweavers

4255 search results - page 12 / 851
» On Learning Boolean Functions
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 7 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
FSE
2004
Springer
92views Cryptology» more  FSE 2004»
14 years 1 months ago
Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...
Pantelimon Stanica, Subhamoy Maitra, John A. Clark
ICML
1999
IEEE
14 years 8 months ago
Approximation Via Value Unification
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
Paul E. Utgoff, David J. Stracuzzi
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
13 years 11 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 5 months ago
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
Arnab Bhattacharyya, Ning Xie