Téléchargez le livre : Combinatorial Algorithms

Combinatorial Algorithms

For Computers and Calculators

de

,

Éditeur :

Academic Press


Paru le : 2014-05-10



eBook Téléchargement ebook sans DRM
57,97 €
Téléchargement immédiat
Dès validation de votre commande
Ajouter à ma liste d'envies
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader
Description
Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2n subsets of the set {1, 2,...,n}. The discussion then turns to the random subset and k-subset of an n-set; next composition of n into k parts; and random composition of n into k parts. Subsequent chapters focus on sequencing, ranking, and selection algorithms in general combinatorial families; renumbering rows and columns of an array; the cycle structure of a permutation; and the permanent function. Sorting and network flows are also examined, along with the backtrack method and triangular numbering in partially ordered sets. This book will be of value to both students and specialists in the fields of applied mathematics and computer science.
Pages
320 pages
Collection
n.c
Parution
2014-05-10
Marque
Academic Press
EAN papier
9780125192606
EAN PDF SANS DRM
9781483273457
Informations sur l'ebook
Ce livre est accessible aux handicaps Voir les informations sur l'accessibilité
Prix
57,97 €

Suggestions personnalisées