3 search results - page 1 / 1 » Free Bits, PCPs, and Nonapproximability-Towards Tight Result... |
107
click to vote
FOCS
1995
IEEE
15 years 2 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
91
Voted
SIAMCOMP
1998
14 years 10 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
126
click to vote
PODC
1993
ACM
15 years 2 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...