research
∙
12/21/2022
Improved Field Size Bounds for Higher Order MDS Codes
Higher order MDS codes are an interesting generalization of MDS codes re...
share
research
∙
12/21/2022
Separating MAX 2-AND, MAX DI-CUT and MAX CUT
Assuming the Unique Games Conjecture (UGC), the best approximation ratio...
research
∙
11/15/2022
SDPs and Robust Satisfiability of Promise CSP
For a constraint satisfaction problem (CSP), a robust satisfaction algor...
research
∙
07/18/2022
Robust Factorizations and Colorings of Tensor Graphs
Since the seminal result of Karger, Motwani, and Sudan, algorithms for a...
research
∙
06/10/2022
Generic Reed-Solomon codes achieve list-decoding capacity
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MD...
research
∙
07/22/2021
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes
An (m,n,a,b)-tensor code consists of m× n matrices whose columns satisfy...
research
∙
02/23/2021
Conditional Dichotomy of Boolean Ordered Promise CSPs
Promise Constraint Satisfaction Problems (PCSPs) are a generalization of...
research
∙
09/22/2020
On the Mysteries of MAX NAE-SAT
MAX NAE-SAT is a natural optimization problem, closely related to its be...
research
∙
07/28/2020
A Simple Sublinear Algorithm for Gap Edit Distance
We study the problem of estimating the edit distance between two n-chara...
research
∙
07/21/2020
Smoothed Complexity of 2-player Nash Equilibria
We prove that computing a Nash equilibrium of a two-player (n × n) game ...
research
∙
10/09/2019
The Resolution of Keller's Conjecture
We consider two graphs, G_7,3 and G_7,4, related to Keller's conjecture ...
research
∙
08/12/2019
Coded trace reconstruction in a constant number of traces
The coded trace reconstruction problem asks to construct a code C⊂{0,1}^...
research
∙
07/09/2019
Symmetric Polymorphisms and Efficient Decidability of Promise CSPs
In the field of constraint satisfaction problems (CSP), promise CSPs are...
research
∙
04/10/2019
Constant-factor approximation of near-linear edit distance in near-linear time
We show that the edit distance between two strings of length n can be co...
research
∙
04/09/2019
Bridging between 0/1 and Linear Programming via Random Walks
Under the Strong Exponential Time Hypothesis, an integer linear program ...
research
∙
02/13/2019
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
We study the complexity of Boolean constraint satisfaction problems (CSP...
research
∙
07/13/2018
