5138 search results - page 127 / 1028 » Randomized Algorithms for 3-SAT |
130
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
112
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
109
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
We present a simple randomized construction of size O
199
click to vote
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
116
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...