Nonserial dynamic programming formulations of satisfiability (Q1099093)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonserial dynamic programming formulations of satisfiability |
scientific article; zbMATH DE number 4039672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonserial dynamic programming formulations of satisfiability |
scientific article; zbMATH DE number 4039672 |
Statements
Nonserial dynamic programming formulations of satisfiability (English)
0 references
1988
0 references
Two nonserial dynamic programming formulations of satisfiability are presented: one mapping planar formulas into nonserial problems with planar interaction graphs, the other mapping bandwidth-k formulas into nonserial problems with bandwidth-k interaction graphs.
0 references
planar separator theorem
0 references
nonserial dynamic programming
0 references
satisfiability
0 references
bandwidth-k interaction graphs
0 references
0 references
0.7630528807640076
0 references
