On the complexity of resolution with bounded conjunctions (Q1885907): Difference between revisions
From MaRDI portal
Latest revision as of 14:13, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of resolution with bounded conjunctions |
scientific article |
Statements
On the complexity of resolution with bounded conjunctions (English)
0 references
12 November 2004
0 references
resolution
0 references
complexity of Proofs
0 references