5138 search results - page 119 / 1028 » Randomized Algorithms for 3-SAT |
103
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
129
click to vote
SLSFS
2005
Springer
15 years 7 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
123
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
STOC
1992
ACM
15 years 6 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
128
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...