Browse by Journal and Volume

Group by: Author(s) | Date | School | No Grouping

Jump to: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences

Number of items: 1.

Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences

Chen, Hubie (2017) Proof complexity modulo the Polynomial Hierarchy: understanding alternation as a source of hardness. ACM Transactions on Computation Theory 9 (3), ISSN 1942-3454.

This list was generated on Wed Aug 13 02:38:21 2025 BST.