29908 search results - page 441 / 5982 » On the Complexity of |
187
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
202
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
192
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider large MIMO systems, where by `large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense i...
152
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
168
Voted
ECCC
2008
15 years 7 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...