Skip to contents

  1. Beame, Paul W. [Contributor]; Buss, Samuel R [Contributor] ; DIMACS (Group), NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science

    Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996

    Books
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Providence, R.I.: American Mathematical Society, 1998

    Published in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science ; v. 39