On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133)
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: On the complexity of finding falsifying assignments for Herbrand disjunctions |
scientific article; zbMATH DE number 6510999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding falsifying assignments for Herbrand disjunctions |
scientific article; zbMATH DE number 6510999 |
Statements
On the complexity of finding falsifying assignments for Herbrand disjunctions (English)
0 references
18 November 2015
0 references
Herbrand theorem
0 references
falsifying assignment
0 references
polynomial search problem
0 references
0.7404011487960815
0 references
0.7293370962142944
0 references
0.7293369174003601
0 references
0.7278554439544678
0 references
0.7273858785629272
0 references
