scientific article; zbMATH DE number 7204252

DOI10.4230/LIPIcs.CCC.2017.1zbMath1445.03064MaRDI QIDQ5111131

Pavel Pudlák, Neil Thapen

Publication date: 26 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

proof complexityrandom resolution

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: