scientific article; zbMATH DE number 3896918
From MaRDI portal
Publication:3676130
Cited in
(15)- Independence results about context-free languages and lower bounds
- Complexity classes without machines: on complete languages for UP
- Computation times of NP sets of different densities
- Optimal proof systems imply complete sets for promise classes
- On an optimal propositional proof system and the structure of easy subsets of TAUT.
- A characterization of the leaf language classes
- scientific article; zbMATH DE number 3873308 (Why is no real title available?)
- scientific article; zbMATH DE number 3877163 (Why is no real title available?)
- scientific article; zbMATH DE number 3921977 (Why is no real title available?)
- scientific article; zbMATH DE number 4106271 (Why is no real title available?)
- scientific article; zbMATH DE number 27190 (Why is no real title available?)
- scientific article; zbMATH DE number 3596249 (Why is no real title available?)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3676130)
