-
76. Super-Recursive Algorithms
by Burgin, Mark
Seller Description: New. Contains: Unspecified. Monographs in Computer Science . Includes unspecified. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers. See More Details
2010, Springer-Verlag New York Inc.
ISBN-13: 9781441930606
Paperback, New
Columbia, MD, USA
$113.73
-
77. Super-Recursive Algorithms
by Burgin, Mark
Seller Description: Fine. Contains: Unspecified. Monographs in Computer Science . Includes unspecified. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers. See More Details
2010, Springer-Verlag New York Inc.
ISBN-13: 9781441930606
Paperback, Fine/Like New
Columbia, MD, USA
$127.71
-
78. Super-Recursive Algorithms (Monographs in Computer Science)
by Burgin, Mark
Seller Description: Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book. See More Details
2010, Springer
ISBN-13: 9781441930606
paperback, Good
Santa Clarita, CA, USA
$127.72
-
79. Super-Recursive Algorithms
by Mark Burgin
eBook See More Details
2004, Springer Nature
eBook ISBN: 9780387955698
Edition: 2005 edition
Format: PDF eBook
Digital download
$29.70
-
80. Super-Recursive Algorithms
by Burgin, Mark
Seller Description: Fair. Sewn binding. Cloth over boards. 304 p. Contains: Unspecified, Tables, black & white. Monographs in Computer Science. See More Details
2004, Springer
ISBN-13: 9780387955698
Hardcover, Fair
Greenfield, MA, USA
$57.38
-
81. Super-Recursive Algorithms (Monographs in Computer Science)
by Burgin, Mark
Seller Description: Like New. Hardcover. Text block firm and clean, binding unblemished, boards straight, without highlights or underlining. Fine, like new condition. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped. See More Details
2004, Springer
ISBN-13: 9780387955698
Hardcover, Good
San Rafael, CA, USA
$57.58
-
82. Super-Recursive Algorithms (Monographs in Computer Science)
Seller Description: Brand New. New. See More Details
2004, Springer
ISBN-13: 9780387955698
New Delhi, DELHI, INDIA
$67.50
-
83. Super-Recursive Algorithms (Monographs in Computer Science)
by Mark Burgin,
Seller Description: Brand New. New. See More Details
2004, Springer
ISBN-13: 9780387955698
New Delhi, DELHI, INDIA
$68.18
-
84. Super-Recursive Algorithms (Monographs in Computer Science)
Seller Description: New, US edition. Satisfaction guaranteed! ! See More Details
2004, Springer
ISBN-13: 9780387955698
Irving, TX, USA
$75.41
-
85. Super-Recursive Algorithms (Monographs in Computer Science)
Seller Description: Brand New. New Book Original US edition, We Ship to PO BOX Address also. See More Details
2004, Springer
ISBN-13: 9780387955698
Sterling Heights, MI, USA
$75.41
-
86. Super-Recursive Algorithms (Monographs in Computer Science)
Seller Description: New, Satisfaction guaranteed! ! See More Details
2004, Springer
ISBN-13: 9780387955698
Irving, TX, USA
$75.62
-
87. Super-Recursive Algorithms
Seller Description: Brand New. New. See More Details
2004, Springer
ISBN-13: 9780387955698
New Delhi, DELHI, INDIA
$83.26
-
88. Super-Recursive Algorithms
Seller Description: New, Satisfaction guaranteed! ! See More Details
2004, Springer
ISBN-13: 9780387955698
Irving, TX, USA
$92.88
-
89. Super-Recursive Algorithms
Seller Description: New, US edition. Satisfaction guaranteed! ! See More Details
2004, Springer
ISBN-13: 9780387955698
Irving, TX, USA
$93.17
