7 search results - page 2 / 2 » On generalized Kneser hypergraph colorings |
100
Voted
IANDC
2007
14 years 11 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
111
click to vote
ATAL
2010
Springer
15 years 7 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...