STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
27
Voted
STOC
1999
ACM
14 years 4 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
STOC
1999
ACM
14 years 4 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...