Non-commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs:In Proceedings of the 30th Annual Computational Complexity Conference (CCC): June 17-19, 2015. Invited to the special journal issue on CCC'15 (Comput. Complexity CC).

Authors
Publication date
17 June 2015
Publisher
Doi

    Abstract

    Abstract is not available.

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Royal Holloway - Pure

      redirect
      oaioai:pure.royalholloway.ac.uk:p...
      Last time updated on 09/08/2016