94 search results - page 6 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...