scientific article
From MaRDI portal
Publication:3900044
zbMath0453.03042MaRDI QIDQ3900044
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (7)
On the metamathematics of the P vs. NP question ⋮ \(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ On feasible numbers ⋮ Bounded arithmetic, proof complexity and two papers of Parikh ⋮ ``NP\(=\)P? and restricted partitions ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Asymptotic invariants, complexity of groups and related problems
This page was built for publication:
