scientific article; zbMATH DE number 1834646
From MaRDI portal
Publication:4779142
zbMath0999.03052MaRDI QIDQ4779142
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360148
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) First-order arithmetic and fragments (03F30) Complexity of proofs (03F20)
Related Items (3)
Iterated multiplication in \(VTC^0\) ⋮ A new proof of the weak pigeonhole principle ⋮ Propositional proof complexity
This page was built for publication:
