Skip to main navigation Skip to search Skip to main content

Parameterized and subexponential-time complexity of satisfiability problems and applications

  • Oesterreichische Nationalbank and Vienna University of Technology

Research output: Contribution to journal › Article › peer-review

Original languageEnglish
Pages (from-to)282-295
Number of pages14
JournalTheoretical Computer Science
Volume607
DOIs
StatePublished - Nov 1 2015

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • Circuit satisfiability
  • Parameterized complexity
  • Subexponential-time complexity

Cite this