612 search results - page 28 / 123 » Hardness assumptions in the foundations of theoretical compu... |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
MST
2008
13 years 7 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
EUROCRYPT
2003
Springer
14 years 28 days ago
2003
Springer
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...