scientific article
From MaRDI portal
Publication:3676130
zbMath0563.03024MaRDI QIDQ3676130
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A characterization of the leaf language classes, An unambiguous class possessing a complete set, On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP, Complexity classes without machines: on complete languages for UP, Optimal proof systems imply complete sets for promise classes, On an optimal propositional proof system and the structure of easy subsets of TAUT., Independence results about context-free languages and lower bounds
