Distributed PCP Theorems for Hardness of Approximation in P
© 2017 IEEE. We present a new distributed} model of probabilistically checkable proofs (PCP). A satisfying assignment x ∈{0,1}^n to a CNF formula φ is shared between two parties, where Alice knows x-1, \dots, x-{n/2, Bob knows x-{n/2+1},\dots,x-n, and both parties know φ. The goal is to have Alice a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2021-11-08T19:26:05Z.
|
| Subjects: | |
| Online Access: | Get fulltext |