Submitted to the Senate of Tel-Aviv University


Part I The first part of this thesis strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the conjecture of [BGLR93]. Consider the task of verifying a witness for the membership of a given input in an NP language, using a constant number of accesses. If the witness is given as a string of characters, we show that it is… (More)


  • Presentations referencing similar topics