MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02464nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520094943.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
013152447x |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 164 .R45 1977 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Reingold, Edward M. |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Combinatorial algorithms : |
| Remainder of title |
theory and practice / |
| Statement of responsibility, etc. |
Edward M. Reingold, Jeorg Nievergelt, and Narsingh Deo |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
London, United Kingdom : |
| Name of publisher, distributor, etc. |
Prentice-Hall, |
| Date of publication, distribution, etc. |
c1977 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 433 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
25 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
What is Combinatorial Computing -- Representation of Combinatorial Objects -- Counting and Estimating -- Exhaustive Search -- Generating Elementary Combinational Objects -- Fast Search -- Sorting -- Graph Algorithms -- The Equivalence of Certain Combinatorial Problems. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
he field of combinatorial algorithms concerns the problems of performing computations on discrete, finite mathematical structures. It is a new field, and only in the past few years has it started to emerge as a systematic body of knowledge instead of a collection of unrelated tricks. Its emergence as a new discipline is due to three factors: An increase in the practical importance of computation of a combinatorial nature, as compared to other computation. Rapid progress, primarily of a mathematical nature, in the design and analysis of algorithms. A shift in emphasis from the consideration of particular combinatorial algorithms to the examination of properties shared by a class of algorithms. The combination of these factors has promoted combinatorial algorithms as an important new discipline on the border between computer science and mathemaics. Courses in combinatorial algorithms and related courses in the analysis of algorithms are now being taught in colleges and universities in computer science, mathematics, electrical engineering, and operations research departments. Combinatorial algorithms can be presented in different ways, and a course or textbook can be directed toward different audiences. This book is aimed at a reader who can best be characterized as having more of a computing background than a mathematics background, a reader who is interested in combinatorial algorithms because of their practical importance. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
ALGORITHMS |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Nievergelt, Jeorg ;Deo, Narsingh |
| Relator term |
co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
