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

Author(s)

• Beame, Paul W.
• Buss, Samuel R.

Bibliographic Information

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

Paul W. Beame, Samuel R. Buss, editors

（DIMACS series in discrete mathematics and theoretical computer science, v. 39）

American Mathematical Society, c1998

Note

Papers from the proceedings of a workshop held in Rutgers, N.J

Includes bibliographical references

Details

• NCID: BA34559576
• ISBN:
  • 0821805770
• LCCN: 97029122
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Providence, R.I.
• Pages/Volumes: xii, 320 p.
• Size: 26 cm
• Classification:
  • LCC : QA9.54
  • DC21 : 511.3
• Subject Headings:
  • LCSH : Proof theory -- Congresses
  • LCSH : Constructive mathematics -- Congresses
  • LCSH : Computational complexity -- Congresses
• Parent Bibliography ID:
  • BA12282377