Proof compression and NP versus PSPACE (Q2631644)
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 7055412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof compression and NP versus PSPACE |
scientific article; zbMATH DE number 7055412 |
Statements
Proof compression and NP versus PSPACE (English)
0 references
15 May 2019
0 references
minimal logic
0 references
proof theory
0 references
digraphs
0 references
propositional complexity
0 references
0 references
0.9302635788917542
0 references
0.7733553647994995
0 references
0.7585715055465698
0 references
0.7535622715950012
0 references
