A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The...
Samuel R. Buss, Christos H. Papadimitriou, John N....