Fr. 532.00

Algorithms and Order

Anglais · Livre de poche

Expédition généralement dans un délai de 1 à 2 semaines (titre imprimé sur commande)

Description

En savoir plus

This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.

Table des matières

I Graphical Data Structures.- Graphical data structures for ordered sets.- Lattices in data analysis: how to draw them with a computer.- A computer program for orthomodular lattices.- II Computational Complexity.- Computationally tractable classes of ordered sets.- The complexity of orders.- The calculation of invariants for ordered sets.- III Sorting and Scheduling.- Data manipulations based on orderings.- Preemptive scheduling.- IV Enumeration.- Enumeration of ordered sets.- 0-1 laws in logic and combinatorics.- V Geometry.- Partial orders and Euclidean geometry.- VI Decision Making.- Human decision making and ordered sets.- VII Problem Sessions.- ORDER's problem list.- Scheduling.- The diagram.- Linear extensions.- Enumeration.- Sorting.- Miscellany.- VIII IndeX.

Détails du produit

Collaboration Iva Rival (Editeur), Ivan Rival (Editeur)
Edition Springer Netherlands
 
Langues Anglais
Format d'édition Livre de poche
Sortie 18.10.2013
 
EAN 9789401076913
ISBN 978-94-0-107691-3
Pages 498
Dimensions 160 mm x 29 mm x 235 mm
Poids 767 g
Illustrations X, 498 p.
Thèmes NATO Science Series C: (Closed
Nato Science Series C:
NATO Science Series C:
Catégorie Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique

Commentaires des clients

Aucune analyse n'a été rédigée sur cet article pour le moment. Sois le premier à donner ton avis et aide les autres utilisateurs à prendre leur décision d'achat.

Écris un commentaire

Super ou nul ? Donne ton propre avis.

Pour les messages à CeDe.ch, veuillez utiliser le formulaire de contact.

Il faut impérativement remplir les champs de saisie marqués d'une *.

En soumettant ce formulaire, tu acceptes notre déclaration de protection des données.