ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > THE WIRE-TAP CHANNEL PROBLEM:
Reports tagged with The Wire-Tap Channel Problem:
TR97-028 | 12th July 1997
Scott E. Decatur, Oded Goldreich, Dana Ron

Computational Sample Complexity

In a variety of PAC learning models, a tradeoff between time and
information seems to exist: with unlimited time, a small amount of
information suffices, but with time restrictions, more information
sometimes seems to be required.
In addition, it has long been known that there are
concept classes that ... more >>>




ISSN 1433-8092 | Imprint