Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2009
Springer
80views Algorithms» more  APPROX 2009»
10 years 8 months ago
The Glauber Dynamics for Colourings of Bounded Degree Trees
Brendan Lucier, Michael Molloy, Yuval Peres
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
10 years 8 months ago
Hierarchy Theorems for Property Testing
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...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
10 years 8 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
10 years 8 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
10 years 8 months ago
Testing Computability by Width Two OBDDs
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 definition of far) from every object w...
Dana Ron, Gilad Tsur
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
10 years 8 months ago
Strong Parallel Repetition Theorem for Free Projection Games
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...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
10 years 8 months ago
Small-Bias Spaces for Group Products
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 ...
Raghu Meka, David Zuckerman
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
10 years 8 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
10 years 8 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
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 ...
Venkatesan Guruswami, Ali Kemal Sinop
APPROX
2009
Springer
129views Algorithms» more  APPROX 2009»
10 years 8 months ago
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
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...
Adam R. Klivans, Philip M. Long, Alex K. Tang
books