612 search results - page 13 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
P2P
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
TVCG
2008
13 years 7 months ago
2008
Even though information visualization (InfoVis) research has matured in recent years, it is generally acknowledged that the field still lacks supporting, encompassing theories. In ...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...