Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394)
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 5000693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unrestricted vs restricted cut in a tableau method for Boolean circuits |
scientific article; zbMATH DE number 5000693 |
Statements
Unrestricted vs restricted cut in a tableau method for Boolean circuits (English)
0 references
23 January 2006
0 references
satisfiability
0 references
Boolean circuits
0 references
cut rule
0 references
proof complexity
0 references
DPLL
0 references
tableau method
0 references
0.7542099952697754
0 references
0.7484773397445679
0 references
