A new kind of tradeoffs in propositional proof complexity (Q3177773)
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 6912612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new kind of tradeoffs in propositional proof complexity |
scientific article; zbMATH DE number 6912612 |
Statements
A New Kind of Tradeoffs in Propositional Proof Complexity (English)
0 references
2 August 2018
0 references
hardness compression
0 references
resolution
0 references
tradeoff
0 references
0.7913108468055725
0 references
0.786586582660675
0 references
0.7846370935440063
0 references
0.7785435318946838
0 references
0.7700900435447693
0 references
