The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2008.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001101327 / rank | |||
Normal rank | |||
Revision as of 09:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of satisfiability problems: Refining Schaefer's theorem |
scientific article |
Statements
The complexity of satisfiability problems: Refining Schaefer's theorem (English)
0 references
30 April 2009
0 references
computational complexity
0 references
constraint satisfaction problem
0 references
propositional satisfiability
0 references
clone theory
0 references
