rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: A=B
  title info:
    title: Equals B
  name:
    name part: Petkovšek, Marko.
    role:
      role term: creator
  name:
    name part: Wilf, Herbert S.
    name part: 1931-2012
  name:
    name part: Zeilberger, Doron.
  name:
    name part: Knuth, Donald Ervin
    name part: 1938-
    role:
      role term: Foreword.
  name:
    name part: Taylor & Francis
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: mau
    place:
      place term: Wellesley, Mass
    publisher: A K Peters
    date issued: ©1996
    date issued: 1996
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xii, 212 pages : illustrations.)
  abstract: 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.
  table of contents: I. Background. 1. Proof Machines. 2. Tightening the Target. 3. The Hypergeometric Database -- II. The Five Basic Algorithms. 4. Sister Celine's Method. 5. Gosper's Algorithm. 6. Zeilberger's Algorithm. 7. The WZ Phenomenon. 8. Algorithm Hyper -- III. Epilogue. 9. An Operator Algebra Viewpoint -- A: The WWW sites and the software.
  note: Marko Petkovšek, Herbert S. Wilf, Doron Zeilberger ; [with foreword by Donald E. Knuth.].
  note: Includes bibliographical references (pages 201-208) and index.
  subject:
    topic: Combinatorial identities
    topic: Data processing
  subject:
    topic: Identités combinatoires
    topic: Informatique
  subject:
    topic: Combinatorial identities
    topic: Data processing
  classification: QA164.9 .P48 1996
  classification: 511.3/0285/51
  classification: 31.12
  classification: *05A10
  classification: 05A30
  classification: 33C20
  classification: 33D15
  classification: 39A70
  classification: 68R05
  classification: SK 170
  classification: SK 680
  classification: 17,1
  classification: DAT 532f
  classification: MAT 335f
  related item:
    identifier: (DLC) 95051210
  identifier: 9780429064586
  identifier: 0429064586
  identifier: 1568810636
  identifier: 9781568810638
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: SFB
    record creation date: 200803
    record change date: 20250728184705.0
    record identifier: in00005653139
    language of cataloging:
      language term: eng