Skip to content

Proof Complexity and Feasible Arithmetics: Dimacs Workshop, April 21-24, 1996
Stock Photo: Cover May Be Different

Proof Complexity and Feasible Arithmetics: Dimacs Workshop, April 21-24, 1996 Hardcover - 1997

by Paul W. Beame; Paul W. Beame (Editor); Samuel R. Buss (Editor)


Details

  • Title Proof Complexity and Feasible Arithmetics: Dimacs Workshop, April 21-24, 1996
  • Author Paul W. Beame; Paul W. Beame (Editor); Samuel R. Buss (Editor)
  • Binding Hardcover
  • Pages 320
  • Volumes 1
  • Language ENG
  • Publisher American Mathematical Society(RI)
  • Date 1997-10
  • ISBN 9780821805770 / 0821805770
  • Library of Congress Catalog Number 97029122
  • Dewey Decimal Code 511.3
Back to Top

More Copies for Sale

Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in...
Stock Photo: Cover May Be Different

Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

by Dimacs (Group), Paul W. Beame (Editor), Samuel R. Buss (Editor)

  • Used
  • Hardcover
Condition
Used:Good
Binding
Hardcover
ISBN 10 / ISBN 13
9780821805770 / 0821805770
Quantity Available
1
Seller
HOUSTON, Texas, United States
Seller rating:
This seller has earned a 4 of 5 Stars rating from Biblio customers.
Item Price
A$36.12
FREE shipping to USA

Show Details

Description:
Amer Mathematical Society, 1997-10-01. Hardcover. Used:Good.
Item Price
A$36.12
FREE shipping to USA
Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in...
Stock Photo: Cover May Be Different

Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

by Dimacs (Group); DIMACS Workshop on Feasible Arithmetics and Length of Proofs (1996 : Rutgers University); Editor-Paul W. Beame; Editor-Samuel R. Buss; Corporate Author-NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Scie

  • Used
  • good
  • Hardcover
Condition
Used - Good
Binding
Hardcover
ISBN 10 / ISBN 13
9780821805770 / 0821805770
Quantity Available
1
Seller
HOUSTON, Texas, United States
Seller rating:
This seller has earned a 4 of 5 Stars rating from Biblio customers.
Item Price
A$37.64
FREE shipping to USA

Show Details

Description:
Amer Mathematical Society, 1997-10. Hardcover. Good.
Item Price
A$37.64
FREE shipping to USA
Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in...
Stock Photo: Cover May Be Different

Proof Complexity and Feasible Arithmetics: Dimacs Workshop April 21-24, 1996 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

by Dimacs (Group)

  • Used
  • good
  • Hardcover
Condition
Used - Good
Binding
Hardcover
ISBN 10 / ISBN 13
9780821805770 / 0821805770
Quantity Available
1
Seller
Newport Coast, California, United States
Seller rating:
This seller has earned a 2 of 5 Stars rating from Biblio customers.
Item Price
A$79.40
FREE shipping to USA

Show Details

Description:
hardcover. Good. Access codes and supplements are not guaranteed with used items.
Item Price
A$79.40
FREE shipping to USA