Join Our Newsletter

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are speciﬁed by a single loca...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The ﬁrst question refers to the relation ...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some deﬁnition of far) from every object w...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

Abstract. This work considers the problem of approximating ﬁxed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...

APPROX

2009

Springer

10 years 8 months ago
2009

Springer

In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...