Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
hardcover. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority!
Seller: Coffee Cat Books, Chapel Hill, NC, U.S.A.
First Edition
Hardcover. Condition: Good. First Edition. First Edition. 1976. Houghton Mifflin Company. Good. Hardcover. Text with scattered markings, underlining & formula notations (most pages clean, some heavy); name stamp of prior owner (professor). Cover moderate edge and shelf wear, rubbing of color to edges and corners. Stamp outer text block. Binding solid & square. From the personal collection of former Computer, Engineering & Electrical Dept. Professor. 549pp including detailed index. isbn 0395206227. Illustrated, formulas. First edition textbook on discrete mathematical structures for computer science by Ronald E. Prather covering graph theory, Boolean algebra, combinatorics, and computational foundations with extensive formulas and detailed index. Ships from the USA, quickly and with care.
Language: English
Published by Boston, Houghton Mifflin Comp, 1976
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. 549 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. L08260 395206227 Sprache: Englisch Gewicht in Gramm: 1030.