Towards NP-P via proof complexity and search (Q3464626)
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: Towards NP-P via proof complexity and search |
scientific article; zbMATH DE number 6536277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards NP-P via proof complexity and search |
scientific article; zbMATH DE number 6536277 |
Statements
27 January 2016
0 references
proof complexity
0 references
proof search
0 references
Cook's program
0 references
proof automatizability
0 references
satisfiability
0 references
0.9885983467102052
0 references
0.9272621273994446
0 references
0.7980806827545166
0 references
