BIROn - Birkbeck Institutional Research Online

Browse by Journal and Volume

Up a level
Export as [feed] Atom [feed] RSS
Group by: Author(s) | Date | School | No Grouping
Jump to: C
Number of items: 1.

C

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 Sun Mar 2 02:40:43 2025 GMT.