Open this publication in new window or tab >>2014 (English)In: Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II / [ed] Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik, Springer Berlin/Heidelberg, 2014, p. 408-419Conference paper, Published paper (Refereed)
Abstract [en]
Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-hard SAT(·) problem. In this paper we extend this method and show that such languages also exist for the max ones problem (Max-Ones(Γ)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages (VCSP(Δ)). With the help of these languages we relate Max-Ones and VCSP to the exponential time hypothesis in several different ways.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 8635
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-112902 (URN)10.1007/978-3-662-44465-8_35 (DOI)000358254600035 ()2-s2.0-84906261436 (Scopus ID)978-3-662-44464-1 (ISBN)978-3-662-44465-8 (ISBN)
Conference
39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014)
2014-12-192014-12-192018-07-17Bibliographically approved