4860 search results - page 188 / 972 » SNPs Problems, Complexity, and Algorithms |
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
FCS
2009
13 years 8 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
ATAL
2008
Springer
14 years 11 days ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
STOC
1993
ACM
14 years 2 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...