How easy it is to know how: an upper bound for the satisfiability problem (Q6545554)
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: How easy it is to know how: an upper bound for the satisfiability problem |
scientific article; zbMATH DE number 7855135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How easy it is to know how: an upper bound for the satisfiability problem |
scientific article; zbMATH DE number 7855135 |
Statements
How easy it is to know how: an upper bound for the satisfiability problem (English)
0 references
29 May 2024
0 references
knowing how
0 references
complexity
0 references
satisfiability
0 references
