ε-agreement is solvable in every CUB space, and simplex agreement on a simplicial complex C is solvable for n+1 processes iff C is (n-1)-connected.
Fernandez de La Vega
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Minimally unsatisfiable 2-CNFs correspond to weak double cycles having at most one skew-symmetry, giving quadratic-time isomorphism and Theta(n^{3k-1}) types for deficiency k.
Proves sharp threshold on mutation parameter χ for (1+1)-EA on Dynamic Binary Value and Uniform weight dynamic linear problems, yielding O(n log n) runtime below threshold and 2^Ω(n) above, plus a second stagnation-distance threshold for the former.
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
citing papers explorer
-
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
Minimally unsatisfiable 2-CNFs correspond to weak double cycles having at most one skew-symmetry, giving quadratic-time isomorphism and Theta(n^{3k-1}) types for deficiency k.