scientific article
From MaRDI portal
Publication:3662621
zbMath0515.68045MaRDI QIDQ3662621
Publication date: 1982
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) Complexity of proofs (03F20)
Related Items (2)
Uniform normal form for general time-bounded complexity classes ⋮ \(\text{NP}\not={co}\)-NP and models of arithmetic
This page was built for publication: