2014•Lecture notes in computer scienceRequires access

Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications

Iyad A. Kanj, Stefan Szeider

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Parameterized complexity, Satisfiability, Computer science, Boolean satisfiability problem, Time complexity, Theoretical computer science, Mathematics, Algorithm

Back to paper search Browse research topics Original source

Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications — Research Paper | ScholarLens