scientific article
From MaRDI portal
Publication:3696516
zbMath0576.68032MaRDI QIDQ3696516
Neil Immerman, Juris Hartmanis
Publication date: 1985
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
A characterization of the leaf language classes, On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP, A note on complete problems for complexity classes, Relativized counting classes: Relations among thresholds, parity, and mods, Complexity classes without machines: on complete languages for UP, On the complexity of ranking, Separating complexity classes with tally oracles
