Algorithms and order
著者
書誌事項
Algorithms and order
（NATO ASI series, ser. C . Mathematical and physical sciences ; v. 255）
Kluwer Academic Publishers, c1989
大学図書館所蔵 件 / 全23件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Proceedings of the NATO Advanced Study Institute on Algorithms and Order, Ottawa, Canada, May 31-June 13, 1987"--T.p. verso
"Published in cooperation with NATO Scientific Affairs Division"
Includes bibliographies and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より