scientific article
From MaRDI portal
Publication:3663271
zbMath0516.03021MaRDI QIDQ3663271
Publication date: 1981
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
Minimal pairs and complete problems, The relativized relationship between probabilistically checkable debate systems, IP and PSPACE, Oracles for structural properties: The isomorphism problem and public-key cryptography, Relativized polynomial hierarchies extending two levels, Relativized circuit complexity