1941 search results - page 29 / 389 » On the Hardness of Approximate Reasoning |
FSS
2007
14 years 11 months ago
2007
AMAI
2002
Springer
14 years 11 months ago
2002
Springer
MLQ
2000
14 years 11 months ago
2000
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
102
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...