1941 search results - page 107 / 389 » On the Hardness of Approximate Reasoning |
171
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
163
click to vote
DLOG
2004
15 years 7 months ago
2004
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics that can be used via a graphical user interface. In addition to that our implementat...
176
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
150
click to vote
CRYPTO
2009
Springer
16 years 29 days ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
175
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...