Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fair. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority!
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Shows minimal wear such as frayed or folded edges, minor rips and tears, and/or slightly worn binding. May have stickers and/or contain inscription on title page. No observed missing pages.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Near Fine. No DJ as Issued. 8vo-over 7¾-9¾" tall A beautiful, crisp, clean hardcover in near fine condition; faint rubbing to edges of boards. No DJ, as issued.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Book. 8vo-over 7¾"-9¾" tall. Natick: Peters, 1996. First edition, first printing. 8vo. Hard cover binding, 212 pp. This book aims to show that computers are not only very fast but, in at least one field of mathematics, pretty smart too. In the area of combinatorial identities, computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. New.