The complexity of read-once resolution (Q1610491)
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 1784202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of read-once resolution |
scientific article; zbMATH DE number 1784202 |
Statements
The complexity of read-once resolution (English)
0 references
20 August 2002
0 references
read-once resolution
0 references
propositional formulas
0 references
complexity
0 references
\(k\)-resolution
0 references
minimal unsatisfiability
0 references
0.8842372298240662
0 references
0.8262723088264465
0 references
0.8103345632553101
0 references
0.8049347400665283
0 references
