| dc.contributor.advisor | Williams, R. Ryan | |
| dc.contributor.author | Kwon, Sophia Seoyoung | |
| dc.date.accessioned | 2023-07-31T19:46:49Z | |
| dc.date.available | 2023-07-31T19:46:49Z | |
| dc.date.issued | 2023-06 | |
| dc.date.submitted | 2023-06-06T16:35:08.444Z | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/151533 | |
| dc.description.abstract | The study of non-interactive proof systems, such as Merlin-Arthur proof systems and probabilistically checkable proofs, can yield insights into problems for which we do not yet have efficient algorithms. This work compiles many recent results in improved non-interactive proof systems–primarily Merlin-Arthur protocols for problems studied in the field of fine-grained complexity–and proposes a construction for interesting Merlin-Arthur protocols for any problem from an efficiently constructable PCP for the same. | |
| dc.publisher | Massachusetts Institute of Technology | |
| dc.rights | In Copyright - Educational Use Permitted | |
| dc.rights | Copyright retained by author(s) | |
| dc.rights.uri | https://rightsstatements.org/page/InC-EDU/1.0/ | |
| dc.title | Toward improved non-interactive proof systems | |
| dc.type | Thesis | |
| dc.description.degree | M.Eng. | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| mit.thesis.degree | Master | |
| thesis.degree.name | Master of Engineering in Electrical Engineering and Computer Science | |
