Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > LINEARITY TEST:
Reports tagged with Linearity test:
TR98-007 | 12th January 1998
Luca Trevisan

#### Recycling Queries in PCPs and in Linearity Tests

We study query-efficient Probabilistically Checkable
Proofs (PCPs) and linearity tests. We focus on the number
of amortized query bits. A testing algorithm uses $q$ amortized
query bits if, for some constant $k$, it reads $qk$ bits and has
error probability at most $2^{-k}$. The best known ... more >>>

TR05-116 | 12th October 2005
Alex Samorodnitsky, Luca Trevisan

#### Gowers Uniformity, Influence of Variables, and PCPs

Gowers introduced, for d\geq 1, the notion of dimension-d uniformity U^d(f)
of a function f: G -> \C, where G is a finite abelian group and \C are the
complex numbers. Roughly speaking, if a function has small Gowers uniformity
of dimension d, then it looks random'' on ... more >>>

TR07-098 | 2nd October 2007
Tali Kaufman, Simon Litsyn, Ning Xie

#### Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)

For Boolean functions that are $\epsilon$-far from the set of linear functions, we study the lower bound on the rejection probability (denoted $\textsc{rej}(\epsilon)$) of the linearity test suggested by Blum, Luby and Rubinfeld. The interest in this problem is partly due to its relation to PCP constructions and hardness of ... more >>>

TR10-112 | 15th July 2010
Subhash Khot, Dana Moshkovitz

#### NP-Hardness of Approximately Solving Linear Equations Over Reals

In this paper, we consider the problem of approximately solving a system of homogeneous linear equations over reals, where each
equation contains at most three variables.

Since the all-zero assignment always satisfies all the equations exactly, we restrict the assignments to be non-trivial". Here is
an informal statement of our ... more >>>

ISSN 1433-8092 | Imprint