scientific article; zbMATH DE number 7046725
From MaRDI portal
Publication:4630802
zbMath1419.03052MaRDI QIDQ4630802
Publication date: 23 April 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (2)
Towards NP-P via proof complexity and search ⋮ ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS
This page was built for publication: