32 search results - page 6 / 7 » On Learning Random DNF Formulas Under the Uniform Distributi... |
IJCAI
2007
13 years 9 months ago
2007
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Lattice-based signature schemes following the GoldreichGoldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's...
SIAMCOMP
2011
13 years 2 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...