15254 search results - page 7 / 3051 » A k |
106
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
141
Voted
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
119
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
129
click to vote
JGT
2010
14 years 10 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
126
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...