liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
2013 (English)In: Principles and Practice of Constraint Programming / [ed] Christian Schulte, Springer Berlin/Heidelberg, 2013, 398-414 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider methods for constructing NP-intermediate problems under the assumption that P ≠ NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-intermediate subproblems for a broad and natural class of parameterizations, and extend the result further such that structural CSP restrictions based on parameters that are hard to compute (such as tree-width) are covered. Hereby we generalize a result by Grohe on width parameters and NP-intermediate problems. For studying certain classes of problems, including CSPs parameterized by constraint languages, we consider more powerful parameterizations. First, we identify a new method for obtaining constraint languages Γ such that CSP(Γ) are NP-intermediate. The sets Γ can have very different properties compared to previous constructions (by, for instance, Bodirsky & Grohe) and provides insights into the algebraic approach for studying the complexity of infinite-domain CSPs. Second, we prove that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems. This settles an open question posed by Nordh & Zanuttini.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 398-414 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8124
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-102673DOI: 10.1007/978-3-642-40627-0_32ISI: 000329244000032ISBN: 978-3-642-40626-3 (print)ISBN: 978-3-642-40627-0 (print)OAI: oai:DiVA.org:liu-102673DiVA: diva2:680747
Conference
19th International Conference on Principles and Practice of Constraint Programming (CP-2013), Uppsala, Sweden, September 16-20, 2013
Available from: 2013-12-18 Created: 2013-12-18 Last updated: 2017-02-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Jonsson, PeterLagerkvist, VictorNordh, Gustav

Search in DiVA

By author/editor
Jonsson, PeterLagerkvist, VictorNordh, Gustav
By organisation
Software and SystemsThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf