✦ LIBER ✦

The Computational Complexity of Some Julia Sets

✍ Scribed by Robert Rettinger; Klaus Weihrauch

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 251 KB
Volume: 66
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80386-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Rate of escape of some chaotic Julia set

Rate of escape of some chaotic Julia sets

✍ Gonzalo Contreras-Barandiarán 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 803 KB

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 Some Pro

The Computational Complexity of Some Problems of Linear Algebra

✍ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=

On Some Complexity Characteristics of Im

On Some Complexity Characteristics of Immune Sets

✍ Valeriy K. Bulitko 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 363 KB 👁 1 views

## Abstract We suggest some new ways to effectivize the definitions of several classes of simple sets. On this basis, new completeness criterions for simple sets are obtained. In particular, we give descriptions of the class of complete maximal sets.