Sciweavers

FOCS
1999
IEEE
13 years 9 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous
FOCS
1999
IEEE
13 years 9 months ago
How Asymmetry Helps Load Balancing
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking
FOCS
1999
IEEE
13 years 9 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
FOCS
1999
IEEE
13 years 9 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai
FOCS
1999
IEEE
13 years 9 months ago
Derandomizing Arthur-Merlin Games Using Hitting Sets
Peter Bro Miltersen, N. V. Vinodchandran
FOCS
1999
IEEE
13 years 9 months ago
Reducing Network Congestion and Blocking Probability Through Balanced Allocation
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...
Malwina J. Luczak, Eli Upfal
FOCS
1999
IEEE
13 years 9 months ago
On the Complexity of SAT
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
Richard J. Lipton, Anastasios Viglas