Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n / by Aviezri S. Frankel and David Lichtenstein. 1979 Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 968 [LeatherBound]

Descripción

Leatherbound edition. Condition: New. Leather Binding on Spine and Corners with Golden leaf printing on spine. Bound in genuine leather with Satin ribbon page markers and Spine with raised gilt bands. Pages: 44. A perfect gift for your loved ones. Reprinted from 1979 edition. NO changes have been made to the original text. This is NOT a retyped or an ocr'd reprint. Illustrations, Index, if any, are included in black and white. Each page is checked manually before printing. As this print on demand book is reprinted from a very old book, there could be some missing or flawed pages, but we always try to make the book as complete as possible. Fold-outs, if any, are not part of the book. If the original book was published in multiple volumes then this reprint is of only one volume, not the whole set. IF YOU WISH TO ORDER PARTICULAR VOLUME OR ALL THE VOLUMES YOU CAN CONTACT US. Resized as per current standards. Sewing binding for longer life, where the book block is actually sewn (smythe sewn/section sewn) with thread before binding which results in a more durable type of binding. Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 968 Language: English Pages: 44 Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 968.

N° de ref. del artículo LB100159653541

Contactar al vendedor

Denunciar este artículo

Detalles bibliográficos

Título

Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n / by Aviezri S. Frankel and David Lichtenstein. 1979 Volume Report (University of Illinois at Urbana-Champaign. Dept. of Computer Science) no. 968 [LeatherBound]

Fecha de publicación

2025

Idioma

Inglés

Encuadernación

LeatheBound

Estado

New