APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...