Automating algebraic proof systems is NP-hard (Q6086995)
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: Automating algebraic proof systems is NP-hard |
scientific article; zbMATH DE number 7765165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automating algebraic proof systems is NP-hard |
scientific article; zbMATH DE number 7765165 |
Statements
Automating algebraic proof systems is NP-hard (English)
0 references
14 November 2023
0 references
algebraic proof systems
0 references
automatability
0 references
lower bounds
0 references
pigeonhole principle
0 references
proof complexity
0 references
0 references
0 references
0 references
0.8617923
0 references
0.8575732
0 references
