Proof compression and NP versus PSPACE. II (Q5147748)
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 7302940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof compression and NP versus PSPACE. II |
scientific article; zbMATH DE number 7302940 |
Statements
Proof Compression and NP Versus PSPACE II (English)
0 references
28 January 2021
0 references
natural deduction
0 references
sequent calculus
0 references
minimal logic
0 references
computational complexity
0 references
0 references
0.9302635788917542
0 references
0.7584822773933411
0 references
0.7459660172462463
0 references
