Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
Abstract. We consider the function ensembles emerging from the construction of Goldreich, Goldwasser and Micali (GGM), when applied to an arbitrary pseudoramdon generator. We show ...
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...