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

On Computational Complexity of Siegel Julia Sets

โœ Scribed by I. Binder; M. Braverman; M. Yampolsky

Publisher
Springer
Year
2006
Tongue
English
Weight
220 KB
Volume
264
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Topological complexity of Julia sets
Topological complexity of Julia sets
โœ Jianyong Qiao ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› SP Science China Press ๐ŸŒ English โš– 491 KB
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

On computational complexity of contextua
On computational complexity of contextual languages
โœ Lucian Ilie ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 726 KB

We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by r