5138 search results - page 35 / 1028 » Randomized Algorithms for 3-SAT |
SODA
2003
ACM
15 years 3 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
117
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
155
click to vote
ECCC
2011
14 years 5 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
106
click to vote
TCS
2010
15 years 5 hour ago
2010
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
129
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...