A mathematical basis for egress complexity

DOI10.1016/0893-9659(96)00016-XMaRDI QIDQ1921174zbMATH OpenOpenAlexFDO

Authors H. A. Donegan, A. J. Pollock

Publication date 12 December 1996

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0893-9659(96)00016-x

zbMATH Keywords

complexity measureShannon entropy

Mathematics Subject Classification ID

System identification (93B30) Measures of information, entropy (94A17)

Recommendations

• Formal aspects of egress complexity
• scientific article; zbMATH DE number 2069492
• Complexity of Ehrenfeucht models
• Mathematical foundation of a new complexity measure
• Towards a mathematics of complexity
• The epsilon calculus and Herbrand complexity
• An algebraic measure of complexity
• Estimating Matveev's complexity via crystallization theory
• A geometric approach to complexity

Cites work

• A Mathematical Theory of Communication
• scientific article; zbMATH DE number 4058912 (Why is no real title available?)
• scientific article; zbMATH DE number 42739 (Why is no real title available?)
• Interfacing architectural CAD data with KBS technology

Cited in

(3)

• Formal aspects of egress complexity
• scientific article; zbMATH DE number 2069492 (Why is no real title available?)
• Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity

This page was built for publication: A mathematical basis for egress complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921174)