612 search results - page 26 / 123 » Hardness assumptions in the foundations of theoretical compu... |
DRUMS
1998
Springer
13 years 12 months ago
1998
Springer
In this paper logical techniques developed to formalise the analysis of multi-interpretable information, in particular belief set operators and selection operators, are applied to...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
PODC
2003
ACM
14 years 29 days ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
WG
2010
Springer
13 years 6 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
RECSYS
2009
ACM
14 years 2 months ago
2009
ACM
We present an incentive-based architecture for providing recommendations in a social network. We maintain a distinct reputation system for each individual and we rely on users to ...