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

The Garland Measure and Computational Complexity of Stack Programs

โœ Scribed by L. Kristiansen; K.-H. Niggl

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
268 KB
Volume
90
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The computational complexity of some fuz
The computational complexity of some fuzzy dynamic programs
โœ A.O. Esogbue ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 KB

Fuzzy dynamic programming, a natural extension of classical dynamic programming, is of great appeal in the modeling and control of certain systems, especially those of a socio-technical systems nature. However, data acquisition, manipulation, and processing create immense problems to the systems des

The Computational Complexity of Choice S
The Computational Complexity of Choice Sets
โœ Felix Brandt; Felix Fischer; Paul Harrenstein ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of