Petkovsek marko (31 risultati)

hardcover. Condizione: Very Good. Very Good text and cover, minor reading wear to text and covers/edges. US orders shipped via US Mail. International orders shipped via DHL. Additional postage may be required on oversize books and sets. NO prison orders.

Hardcover. Condizione: 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.

Hardcover. Condizione: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

hardcover. Condizione: 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.

Hardcover. Condizione: Very Good. Minor wear only. The pages are clean and crisp with no highlighting or writing detected. Ships from Canada. Satisfaction guaranteed with 30-day return policy.; 7.75 X 0.5 X 9.75 inches; 230 pages; R0 2.7m/2.7m s0.

Hardcover. Condizione: Near Fine. No DJ as Issued. 1st Edition. A beautiful, crisp, clean hardcover in near fine condition; faint rubbing to edges of boards. No DJ, as issued.

Hardcover. Condizione: New. First Edition. 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. …

Condizione: FINE. *FIRST EDITION*. 212 PAGES.

Cloth. Condizione: Near Fine. First Printing. 8vo - over 7¾" - 9¾" tall. 212pp. Foreword by Donald E. Knuth. Algorithm, proofs and examples. Bibliography. Index. Bound in black cloth boards.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: New. Satisfaction Guaranteed or your money back.

Kartoniert / Broschiert. Condizione: New. Petkovsek, Marko Wilf, Herbert S Zeilberger, DoronThis book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifull.

Taschenbuch. Condizione: Neu. A = B | Marko Petkovsek (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2019 | Taylor & Francis | EAN 9780367448714 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Paperback. Condizione: Brand New. 224 pages. 9.25x7.17x0.67 inches. In Stock.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. Petkovsek, Marko Wilf, Herbert S Zeilberger, DoronThis book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifull.

Hardcover. Condizione: Brand New. 224 pages. 9.75x7.75x0.50 inches. In Stock.

Buch. Condizione: Neu. Neuware - This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics.From the table of contents: \* Proof Machines \* Tightening the Target \* The Hypergeometric Database \* The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper \* Epilogue: An Operator Algebra Viewpoint \* The WWW Sites and the Software (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises.…

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics.From the table of contents: \* Proof Machines \* Tightening the Target \* The Hypergeometric Database \* The Five Basic Algorithms: Sister Celine's Method, Gosper&'s Algorithm, Zeilberger's Algorithm, The WZ Phenomenon, Algorithm Hyper \* Epilogue: An Operator Algebra Viewpoint \* The WWW Sites and the Software (Maple and Mathematica) Each chapter contains an introduction to the subject and ends with a set of exercises. 230 pp. Englisch.…