1732 search results - page 5 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
77
Voted
FOCS
2008
IEEE
15 years 3 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 ...
JGT
2010
14 years 4 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 ...
COMBINATORICA
2006
14 years 9 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
ISCAS
2007
IEEE
15 years 3 months ago
2007
IEEE
—It is investigated to what extent the trajectories of a stochastically switched (blinking) system follow the corresponding trajectories of the averaged system. Four cases have t...
STOC
2005
ACM
15 years 9 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...