"Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS ..."

Paul Beame, Samuel R. Buss (1998)

> Home

Details and statistics

DOI: 10.1090/DIMACS/039

access: closed

type: Editorship

metadata version: 2023-09-30

- view
  authority control:
- export record
  dblp key:
  - conf/dimacs/dimacs39
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/dimacs39
Paul Beame, Samuel R. Buss:
Proof Complexity and Feasible Arithmetics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 39, DIMACS/AMS 1998, ISBN 978-0-8218-0577-0 [contents]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.