We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
We pay homage to George B. Dantzig by describing a less well known part of his legacy--his early and dedicated championship of the importance of systems optimization in solving co...
Philip E. Gill, Walter Murray, Michael A. Saunders...
Batch verification of digital signatures is used to improve the computational complexity when a large number of digital signatures must be verified. Lee at al. [2] proposed a new ...
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...