Unrestricted resolution versus N-resolution (Q1185013)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 35442
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrestricted resolution versus N-resolution |
scientific article; zbMATH DE number 35442 |
Statements
Unrestricted resolution versus N-resolution (English)
0 references
28 June 1992
0 references
complexity of proof systems
0 references
restriction
0 references
theorem-proving algorithms
0 references
\(N\)-resolution
0 references
0.8529286980628967
0 references
0.8529286980628967
0 references
0.8125996589660645
0 references
0.8125996589660645
0 references
