4255 search results - page 6 / 851 » On Learning Boolean Functions |
ADBIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
ACISP
1999
Springer
13 years 12 months ago
1999
Springer
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...
IACR
2011
12 years 7 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
AAECC
2007
Springer
14 years 1 months ago
2007
Springer
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Sy...