Feasible Computations and Provable Complexity Properties
by Juris Hartmanis
- Used
- Paperback
- Condition
- Very Good+
- ISBN 10
- 0898710278
- ISBN 13
- 9780898710274
- Seller
-
Moraga, California, United States
Payment Methods Accepted
About This Item
Philadelphia: Society for Industrial and Applied Mathematics, 1978. Softcover. Very Good+. 6 3/4 x 9 3/4. 1I Binding tight, spine uncreased. No marks. Minor wear to sunned covers.
Reviews
(Log in or Create an Account first!)
Details
- Bookseller
- Fox & Hedgehog (US)
- Bookseller's Inventory #
- 218
- Title
- Feasible Computations and Provable Complexity Properties
- Author
- Juris Hartmanis
- Format/Binding
- Softcover
- Book Condition
- Used - Very Good+
- Binding
- Paperback
- ISBN 10
- 0898710278
- ISBN 13
- 9780898710274
- Publisher
- Society for Industrial and Applied Mathematics
- Place of Publication
- Philadelphia
- Date Published
- 1978
- Pages
- 62
- Size
- 6 3/4 x 9 3/4
- Keywords
- Mathematics, math, machine theory, formal languages, computational complexity
- X weight
- 13 oz
Terms of Sale
Fox & Hedgehog
30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.
About the Seller
Fox & Hedgehog
Biblio member since 2022
Moraga, California
About Fox & Hedgehog
Fox & Hedgehog sells interesting books on all subjects.
Glossary
Some terminology that may be used in this description includes:
- Spine
- The outer portion of a book which covers the actual binding. The spine usually faces outward when a book is placed on a shelf....
- Good+
- A term used to denote a condition a slight grade better than Good.
- Tight
- Used to mean that the binding of a book has not been overly loosened by frequent use.
- Sunned
- Damage done to a book cover or dust jacket caused by exposure to direct sunlight. Very strong fluorescent light can cause slight...