An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

We propose an analytical framework for studying parallel repetition, a basic product
operation for one-round twoplayer games. In this framework, we consider a relaxation of the …

Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower
complexity than required for classical NP verification. Traditionally, the focus has been on …

Abstract The family of Reed-Solomon (RS) codes plays a prominent role in the construction
of quasilinear probabilistically checkable proofs (PCPs) and interactive oracle proofs (IOPs) …

Property testing is concerned with the design of super-fast algorithms for the structural
analysis of large quantities of data. The aim is to unveil global features of the data, such as …

In the Densest k-Subgraph (D k S) problem, given an undirected graph G and an integer k,
the goal is to find a subgraph of G on k vertices that contains maximum number of edges …

Subexponential time approximation algorithms are presented for the Unique Games and
Small-Set Expansion problems. Specifically, for some absolute constant c, the following two …

In our recent paper [Rubinstein 2016] we rule out a PTAS for the 2-Player Nash Equilibrium
Problem. More precisely, we prove that there exists a constant ϵ> 0 such that, assuming the …

We consider relative error low rank approximation of tensors with respect to the Frobenius
norm. Namely, given an order-q tensor A∊ ℝ∏ i= 1 q ni, output a rank-k tensor B for which …

We suggest the research agenda of establishing new hardness of approximation results
based on the “projection games conjecture”, ie, an instantiation of the Sliding Scale …