79 search results - page 4 / 16 » stoc 2005 |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding ReedSolomon codes.
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We study the problem of obfuscation in the context of point functions (also known as delta functions). A point function is a Boolean function that assumes the value 1 at exactly o...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...