Towards a theory of algorithmic proof complexity (invited talk) (Q6560784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards a theory of algorithmic proof complexity (invited talk) |
scientific article; zbMATH DE number 7870211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a theory of algorithmic proof complexity (invited talk) |
scientific article; zbMATH DE number 7870211 |
Statements
Towards a theory of algorithmic proof complexity (invited talk) (English)
0 references
24 June 2024
0 references
proof complexity
0 references
logic
0 references
computational complexity
0 references
