Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity
Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the runni...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer US
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148127 |
| _version_ | 1811089000362934272 |
|---|---|
| author | Akmal, Shyan Chen, Lijie Jin, Ce Raj, Malvika Williams, Ryan |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Akmal, Shyan Chen, Lijie Jin, Ce Raj, Malvika Williams, Ryan |
| author_sort | Akmal, Shyan |
| collection | MIT |
| description | Abstract
In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:
Certifying that a list of n integers has no 3-SUM solution can be done in Merlin–Arthur time
$$\tilde{O}(n)$$
O
~
(
n
)
. Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in
$$\tilde{O}(n^{1.5})$$
O
~
(
n
1.5
)
time (that is, there is a proof system with proofs of length
$$\tilde{O}(n^{1.5})$$
O
~
(
n
1.5
)
and a deterministic verifier running in
$$\tilde{O}(n^{1.5})$$
O
~
(
n
1.5
)
time).
Counting the number of k-cliques with total edge weight equal to zero in an n-node graph can be done in Merlin–Arthur time
$${\tilde{O}}(n^{\lceil k/2\rceil })$$
O
~
(
n
⌈
k
/
2
⌉
)
(where
$$k\ge 3$$
k
≥
3
). For odd k, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in an m-edge graph can be done in Merlin–Arthur time
$${\tilde{O}}(m)$$
O
~
(
m
)
. Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only count k-cliques in unweighted graphs, and had worse running times for small k.
Computing the All-Pairs Shortest Distances matrix for an n-node graph can be done in Merlin–Arthur time
$$\tilde{O}(n^2)$$
O
~
(
n
2
)
. Note this is optimal, as the matrix can have
$$\Omega (n^2)$$
Ω
(
n
2
)
nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an
$$\tilde{O}(n^{2.94})$$
O
~
(
n
2.94
)
nondeterministic time algorithm.
Certifying that an n-variable k-CNF is unsatisfiable can be done in Merlin–Arthur time
$$2^{n/2 - n/O(k)}$$
2
n
/
2
-
n
/
O
(
k
)
. We also observe an algebrization barrier for the previous
$$2^{n/2}\cdot \textrm{poly}(n)$$
2
n
/
2
·
poly
(
n
)
-time Merlin–Arthur protocol of R. Williams [CCC’16] for
$$\#$$
#
SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol for k-UNSAT running in
$$2^{n/2}/n^{\omega (1)}$$
2
n
/
2
/
n
ω
(
1
)
time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.
Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time
$$2^{4n/5}\cdot \textrm{poly}(n)$$
2
4
n
/
5
·
poly
(
n
)
. Previously, the only nontrivial result known along these lines was an Arthur Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in
$$2^{2n/3}\cdot \textrm{poly}(n)$$
2
2
n
/
3
·
poly
(
n
)
time.
Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution to n integers can be done in Merlin–Arthur time
$$2^{n/3}\cdot \textrm{poly}(n)$$
2
n
/
3
·
poly
(
n
)
, improving on the previous best protocol by Nederlof [IPL 2017] which took
$$2^{0.49991n}\cdot \textrm{poly}(n)$$
2
0.49991
n
·
poly
(
n
)
time. |
| first_indexed | 2024-09-23T14:11:20Z |
| format | Article |
| id | mit-1721.1/148127 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T14:11:20Z |
| publishDate | 2023 |
| publisher | Springer US |
| record_format | dspace |
| spelling | mit-1721.1/1481272024-01-19T19:23:53Z Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity Akmal, Shyan Chen, Lijie Jin, Ce Raj, Malvika Williams, Ryan Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include: Certifying that a list of n integers has no 3-SUM solution can be done in Merlin–Arthur time $$\tilde{O}(n)$$ O ~ ( n ) . Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in $$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) time (that is, there is a proof system with proofs of length $$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) and a deterministic verifier running in $$\tilde{O}(n^{1.5})$$ O ~ ( n 1.5 ) time). Counting the number of k-cliques with total edge weight equal to zero in an n-node graph can be done in Merlin–Arthur time $${\tilde{O}}(n^{\lceil k/2\rceil })$$ O ~ ( n ⌈ k / 2 ⌉ ) (where $$k\ge 3$$ k ≥ 3 ). For odd k, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in an m-edge graph can be done in Merlin–Arthur time $${\tilde{O}}(m)$$ O ~ ( m ) . Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only count k-cliques in unweighted graphs, and had worse running times for small k. Computing the All-Pairs Shortest Distances matrix for an n-node graph can be done in Merlin–Arthur time $$\tilde{O}(n^2)$$ O ~ ( n 2 ) . Note this is optimal, as the matrix can have $$\Omega (n^2)$$ Ω ( n 2 ) nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an $$\tilde{O}(n^{2.94})$$ O ~ ( n 2.94 ) nondeterministic time algorithm. Certifying that an n-variable k-CNF is unsatisfiable can be done in Merlin–Arthur time $$2^{n/2 - n/O(k)}$$ 2 n / 2 - n / O ( k ) . We also observe an algebrization barrier for the previous $$2^{n/2}\cdot \textrm{poly}(n)$$ 2 n / 2 · poly ( n ) -time Merlin–Arthur protocol of R. Williams [CCC’16] for $$\#$$ # SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol for k-UNSAT running in $$2^{n/2}/n^{\omega (1)}$$ 2 n / 2 / n ω ( 1 ) time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol. Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time $$2^{4n/5}\cdot \textrm{poly}(n)$$ 2 4 n / 5 · poly ( n ) . Previously, the only nontrivial result known along these lines was an Arthur Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in $$2^{2n/3}\cdot \textrm{poly}(n)$$ 2 2 n / 3 · poly ( n ) time. Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution to n integers can be done in Merlin–Arthur time $$2^{n/3}\cdot \textrm{poly}(n)$$ 2 n / 3 · poly ( n ) , improving on the previous best protocol by Nederlof [IPL 2017] which took $$2^{0.49991n}\cdot \textrm{poly}(n)$$ 2 0.49991 n · poly ( n ) time. 2023-02-21T17:41:30Z 2023-02-21T17:41:30Z 2023-02-17 2023-02-19T05:37:51Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/148127 Akmal, Shyan, Chen, Lijie, Jin, Ce, Raj, Malvika and Williams, Ryan. 2023. "Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity." PUBLISHER_CC en https://doi.org/10.1007/s00453-023-01102-6 Creative Commons Attribution https://creativecommons.org/licenses/by/4.0/ The Author(s) application/pdf Springer US Springer US |
| spellingShingle | Akmal, Shyan Chen, Lijie Jin, Ce Raj, Malvika Williams, Ryan Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title | Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title_full | Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title_fullStr | Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title_full_unstemmed | Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title_short | Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity |
| title_sort | improved merlin arthur protocols for central problems in fine grained complexity |
| url | https://hdl.handle.net/1721.1/148127 |
| work_keys_str_mv | AT akmalshyan improvedmerlinarthurprotocolsforcentralproblemsinfinegrainedcomplexity AT chenlijie improvedmerlinarthurprotocolsforcentralproblemsinfinegrainedcomplexity AT jince improvedmerlinarthurprotocolsforcentralproblemsinfinegrainedcomplexity AT rajmalvika improvedmerlinarthurprotocolsforcentralproblemsinfinegrainedcomplexity AT williamsryan improvedmerlinarthurprotocolsforcentralproblemsinfinegrainedcomplexity |