Unrestricted resolution versus N-resolution (Q1185013): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90216-3 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076663305 / rank | |||
Revision as of 10:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unrestricted resolution versus N-resolution |
scientific article |
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
