Focussing, \(\mathsf{MALL}\) and the polynomial hierarchy

DOI10.1007/978-3-319-94205-6_45zbMath1468.68103OpenAlexW2809834569MaRDI QIDQ1799136

Anupam Das

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94205-6_45

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (1)

From QBFs to \textsf{MALL} and back via focussing

This page was built for publication: Focussing, \(\mathsf{MALL}\) and the polynomial hierarchy