๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial Complexes: A Mathematical Theory of Algorithms.by Peter H. Sellers

โœ Scribed by Review by: Earl Glen Whitehead, Jr.

Book ID
124939390
Publisher
Society for Industrial and Applied Mathematics
Year
1981
Tongue
English
Weight
282 KB
Volume
23
Category
Article
ISSN
0036-1445

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial analysis of a chemical net
Combinatorial analysis of a chemical network
โœ Peter H. Sellers ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1018 KB

This paper demonstrates the combinatorial rekztionships among the sets of chemical components, reactions, mechanisms, catalyzations, etc. in a chemical system by solving a problem of the following nature: 28 chemical equations are given; one of them describes the overall chemical reaction of a parti

[North-Holland Mathematics Studies] Anna
[North-Holland Mathematics Studies] Annals of Discrete Mathematics (26): Algorithms in Combinatorial Design Theory Volume 114 || A Census of Orthogonal Steiner Triple Systems of Order 15
โœ Gibbons, Peter B. ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier ๐ŸŒ English โš– 673 KB

The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope with