1941 search results - page 180 / 389 » On the Hardness of Approximate Reasoning |
193
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
126
click to vote
COLING
2010
15 years 1 months ago
2010
Creating correct, semantic representations of questions is essential for applications that can use formal reasoning to answer them. However, even within a restricted domain, it is...
176
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
271
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...