131 search results - page 17 / 27 » The complexity of Boolean functions from cryptographic viewp... |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
IANDC
2007
13 years 7 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
JMLR
2002
13 years 7 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...