244
click to vote
APPROX
14 years 6 months ago
2011 Springer 
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
178
click to vote
APPROX
14 years 6 months ago
2011 Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
183
click to vote
APPROX
14 years 6 months ago
2011 Springer 
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
185
click to vote
APPROX
14 years 6 months ago
2011 Springer 
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
|
Algorithms