165 search results - page 20 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
CSL
2010
Springer
13 years 11 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
AAAI
1998
13 years 11 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
IPSN
2005
Springer
14 years 3 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
ICDE
2011
IEEE
13 years 1 months ago
2011
IEEE
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...