We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for λ ∈ { ±1± √ 5 2 , ± √ 2, ± √ 3} that...
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
—Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for differe...