812 search results - page 47 / 163 » corr 2007 |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
CORR
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we present a generic attack for ciphers, which is in essence a collision attack on the secret keys of ciphers .
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Only the Table of Contents and the Abstract appear in http://www.ingber.com/markets05_trd.pdf, as the publisher has requested all previous papers be removed from the internet. The ...