Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Bhangale, Amey"'
We propose a framework of algorithm vs. hardness for all Max-CSPs and demonstrate it for a large class of predicates. This framework extends the work of Raghavendra [STOC, 2008], who showed a similar result for almost satisfiable Max-CSPs. Our framew
Externí odkaz:
http://arxiv.org/abs/2408.15377
In a $3$-$\mathsf{XOR}$ game $\mathcal{G}$, the verifier samples a challenge $(x,y,z)\sim \mu$ where $\mu$ is a probability distribution over $\Sigma\times\Gamma\times\Phi$, and a map $t\colon \Sigma\times\Gamma\times\Phi\to\mathcal{A}$ for a finite
Externí odkaz:
http://arxiv.org/abs/2408.09352
We study parallel repetition of k-player games where the constraints satisfy the projection property. We prove exponential decay in the value of a parallel repetition of projection games with value less than 1.
Comment: 17 pages
Comment: 17 pages
Externí odkaz:
http://arxiv.org/abs/2312.04783
For a prime $p$, a restricted arithmetic progression in $\mathbb{F}_p^n$ is a triplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a non-zero element from $\{0,1,2\}^n$. What is the size of the largest $A\subseteq \mathbb{F}_p^n$ t
Externí odkaz:
http://arxiv.org/abs/2308.06600
We prove a stability result for general $3$-wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if $\Sigma,\Gamma$ and $\Phi$ are alphabets of constant size, and $\mu$ is a pairwise connected di
Externí odkaz:
http://arxiv.org/abs/2307.16248
Autor:
Bhangale, Amey, Stankovic, Aleksa
Factor graph of an instance of a constraint satisfaction problem with n variables and m constraints is the bipartite graph between [m] and [n] describing which variable appears in which constraints. Thus, an instance of a CSP is completely defined by
Externí odkaz:
http://arxiv.org/abs/2111.09256
Publikováno v:
In Proc. 13th ITCS, volume 215 of LIPIcs, 2022
In this note, we show the mixing of three-term progressions $(x, xg, xg^2)$ in every finite quasirandom groups, fully answering a question of Gowers. More precisely, we show that for any $D$-quasirandom group $G$ and any three sets $A_1, A_2, A_3 \su
Externí odkaz:
http://arxiv.org/abs/2109.12627
Autor:
Bhangale, Amey, Khot, Subhash
A seminal result of H\r{a}stad [J. ACM, 48(4):798--859, 2001] shows that it is NP-hard to find an assignment that satisfies $\frac{1}{|G|}+\varepsilon$ fraction of the constraints of a given $k$-LIN instance over an abelian group, even if there is an
Externí odkaz:
http://arxiv.org/abs/2009.02815
The problem of finding longest common subsequence (LCS) is one of the fundamental problems in computer science, which finds application in fields such as computational biology, text processing, information retrieval, data compression etc. It is well
Externí odkaz:
http://arxiv.org/abs/2006.13449
Publikováno v:
In Proc. 61st FOCS, 2020
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each query and the
Externí odkaz:
http://arxiv.org/abs/2005.03123