Lower Bounds on OBDD Proofs with Several Orders (Q5056355)
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 7628968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower Bounds on OBDD Proofs with Several Orders |
scientific article; zbMATH DE number 7628968 |
Statements
Lower Bounds on OBDD Proofs with Several Orders (English)
0 references
8 December 2022
0 references
lower bounds
0 references
multipartity communication complexity
0 references
OBDD
0 references
projection rule
0 references
proof system
0 references
reordering rule
0 references
Tseitin formulas
0 references
proof complexity
0 references
0.8634728193283081
0 references
0.8534436225891113
0 references
0.8497872948646545
0 references
