scientific article
From MaRDI portal
Publication:3942398
zbMath0483.68046MaRDI QIDQ3942398
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)
Related Items (2)
Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ A low and a high hierarchy within NP
This page was built for publication:
