Sciweavers

COLT
1991
Springer
15 years 8 months ago
Improved Learning of AC0 Functions
Two extensions of the Linial, Mansour, Nisan AC0 learning algorithm are presented. The LMN method works when input examples are drawn uniformly. The new algorithmsimprove on their...
Merrick L. Furst, Jeffrey C. Jackson, Sean W. Smit...
COLT
1991
Springer
15 years 8 months ago
The Role of Learning in Autonomous Robots
Applications of learning to autonomous agents (simulated or real) have often been restricted to learning a mapping from perceived state of the world to the next action to take. Of...
Rodney A. Brooks
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
15 years 8 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 8 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson