STOC
2006
ACM
15 years 5 months ago
2006
ACM
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
STOC
2006
ACM
15 years 5 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
STOC
2006
ACM
15 years 5 months ago
2006
ACM
STOC
2006
ACM
15 years 5 months ago
2006
ACM
We consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case invert...
STOC
2006
ACM
15 years 5 months ago
2006
ACM
STOC
2006
ACM
15 years 5 months ago
2006
ACM
STOC
2006
ACM
15 years 5 months ago
2006
ACM
STOC
2007
ACM
15 years 5 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
STOC
2007
ACM
15 years 5 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
STOC
2007
ACM
15 years 5 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...