Opening book details…
Can I read A=B on EtoBox?
A=B by Petkovsek M., et al. is a nonfiction available to read on EtoBox.
What is A=B about?
In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks.
Who reads A=B?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Petkovsek M., et al.
- Published
- 1996
- Language
- EN
- Category
- nonfiction
- Subjects
- Computer Science, Stem
More by Petkovsek M., et al.
Browse all works by Petkovsek M., et al.
Similar books
- Combinatorial Optimization: Polyhedra and Efficiency (3 volumes, A,B, & C) — Alexander Schrijver (2003)
- Computational Aspects of Polynomial Identities: Volume l, Kemer's Theorems, 2nd Edition (Monographs and Research Notes in Mathematics) — Kanel-Belov, Alexei; Karasik, Yakov; Rowen, Louis Halle (2015)
- Algebra : A Teaching and Source Book — Ernest Shult and David Surowski (2015)
- Metamathematics, Machines and Goedel's Proof — N Shankar; Cambridge University Press (1994)
- Theorems, Corollaries, Lemmas, and Methods of Proof (Pure and Applied Mathematics: A Wiley-Interscience Series of Texts, Monographs and Tracts) — Richard J. Rossi (2006)
- A Model–Theoretic Approach to Proof Theory (Trends in Logic Book 51) (2019)