24 search results - page 3 / 5 » focs 1990 |
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
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...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
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...
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
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...
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
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...
FOCS
1990
IEEE
13 years 10 months ago
1990
IEEE
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...