12 search results - page 3 / 3 » A Reduct Solving Parallel Algorithm Based on Relational Exte... |
ICDT
2005
ACM
13 years 11 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
CC
2007
Springer
13 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...