2026-09-19T04:30:40Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1227712023-08-30T13:51:58Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Richard Ryan Williams.
Vyas, Nikhil(Electrical engineer and computer scientist)Massachusetts Institute of Technology.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2019-11-04T20:23:27Z
2019-11-04T20:23:27Z
2019
2019
https://hdl.handle.net/1721.1/122771
1125006408
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 45-47).
In this thesis we study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness, when the initial gap is a constant. In particular, we show that PCP[subscript c,s][r, q] [mathematical symbol] PCP[subscript 1,s'][r + 0(1), q+ 0 (r)] for c - s = [omega](1) which in turn implies that one can convert imperfect completeness to perfect in linear-sized PCPs for NTIME[0(n)] with a 0(log n) additive loss in the query complexity q. We show our result by constructing a "robust circuit" using threshold gates. These results are a gap amplification procedure for PCPs (when completeness is imperfect), analogous to questions studied in parallel repetition [21] and pseudorandomness [141. We also investigate the time complexity of approximating perfectly satisfiable instances of 3SAT versus those with imperfect completeness. We show that the Gap-ETH conjecture without perfect completeness is equivalent to Gap-ETH with perfect completeness; that is, MAX 3SAT(1 - [epsilon], 1 - [delta]) for [delta] > [epsilon] has 2⁰([superscript n])-time algorithms if and only if MAX 3SAT(1, 1 - [delta]) has 2⁰([superscript n])-time algorithms. We also relate the time complexities of these two problems in a more fine-grained way, to show that T₂ (n) </= T₁ (n(log log n)⁰(¹)), where T₁(n), T₂(n) denote the randomized time-complexity of approximating MAX 3SAT with perfect and imperfect completeness, respectively. This is joint work with Mitali Bafna.
by Nikhil Vyas.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
47 pages ;
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Imperfect gaps in Gap-ETH and PCPs
Thesis
application/pdf
2019-11-04T20:23:26Z
Publication
Master
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7da03017-46db-4e9d-bbb7-7af233ccb5f0">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Imperfect gaps in Gap-ETH and PCPs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2019</PublicationDate>
<Authors>
<Author>
<DisplayName>Vyas, Nikhil(Electrical engineer and computer scientist)Massachusetts Institute of Technology.</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis we study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness, when the initial gap is a constant. In particular, we show that PCP[subscript c,s][r, q] [mathematical symbol] PCP[subscript 1,s'][r + 0(1), q+ 0 (r)] for c - s = [omega](1) which in turn implies that one can convert imperfect completeness to perfect in linear-sized PCPs for NTIME[0(n)] with a 0(log n) additive loss in the query complexity q. We show our result by constructing a "robust circuit" using threshold gates. These results are a gap amplification procedure for PCPs (when completeness is imperfect), analogous to questions studied in parallel repetition [21] and pseudorandomness [141. We also investigate the time complexity of approximating perfectly satisfiable instances of 3SAT versus those with imperfect completeness. We show that the Gap-ETH conjecture without perfect completeness is equivalent to Gap-ETH with perfect completeness; that is, MAX 3SAT(1 - [epsilon], 1 - [delta]) for [delta] > [epsilon] has 2⁰([superscript n])-time algorithms if and only if MAX 3SAT(1, 1 - [delta]) has 2⁰([superscript n])-time algorithms. We also relate the time complexities of these two problems in a more fine-grained way, to show that T₂ (n) </= T₁ (n(log log n)⁰(¹)), where T₁(n), T₂(n) denote the randomized time-complexity of approximating MAX 3SAT with perfect and imperfect completeness, respectively. This is joint work with Mitali Bafna.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>