𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of fixed points

✍ Scribed by Krzysztof Sikorski

Book ID
107508542
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
404 KB
Volume
6
Category
Article
ISSN
1661-7738

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity of fixed points, I
Complexity of fixed points, I
✍ K Sikorski; H WoΕΊniakowski πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 811 KB
Computational complexity of relating tim
Computational complexity of relating time points with intervals
✍ Peter Jonsson; Thomas Drakengren; Christer BΓ€ckstrΓΆm πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 190 KB

Several algebras have been proposed for reasoning about qualitative constraints over the time line. One of these algebras is Vilain's point-interval algebra, which can relate time points with time intervals. Apart from being a stand-alone qualitative algebra, it is also used as a subalgebra in Meiri

Computing Kakutani Fixed Points
Computing Kakutani Fixed Points
✍ Eaves, B. Curtis πŸ“‚ Article πŸ“… 1971 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 709 KB