Sciweavers

812 search results - page 57 / 163
» corr 2007
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 10 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
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)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 10 months ago
Periodicity of certain piecewise affine planar maps
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...
Shigeki Akiyama, Horst Brunotte, Attila Pethö...
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 10 months ago
CD(4) has bounded width
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...
Catarina Carvalho, Víctor Dalmau, Petar Mar...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 10 months ago
Constructions for Difference Triangle Sets
—Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for differe...
Yeow Meng Chee, Charles J. Colbourn
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 10 months ago
SECOQC White Paper on Quantum Key Distribution and Cryptography
Romain Alleaume, Jan Bouda, Cyril Branciard, Thier...