Birkbeck, University of London logo
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: October 2017
    Number of items: 1.

    October 2017

    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 Sat Dec 21 04:33:33 2024 GMT.