✦ LIBER ✦

An algebraic measure of complexity

✍ Scribed by Jesús Urías

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 757 KB
Volume: 47
Category: Article
ISSN: 0167-2789
DOI: 10.1016/0167-2789(91)90044-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The renormalized entropy—an appropriate

The renormalized entropy—an appropriate complexity measure?

✍ P. Saparin; A. Witt; J. Kurths; V. Anishchenko 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 709 KB

Computational Complexity of Algebraic Fu

Computational Complexity of Algebraic Functions

✍ Nicholas Pippenger 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A statistical measure of complexity

✍ R. López-Ruiz; H.L. Mancini; X. Calbet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

Semi-algebraic Complexity—Additive Compl

Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks

✍ Thomas Lickteig; Klaus Meer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

An entropy-based complexity measure for

An entropy-based complexity measure for object-oriented designs

✍ Bansiya, Jagdish; Davis, Carl; Etzkorn, Letha 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

The use of entropy as a measure of information content has led to its use in measuring the code complexity of functionally developed software products; however, no similar capability exists for evaluating complexities of object-oriented systems using entropy. In this paper a new metric based on entr

Correction to “Computational complexity

Correction to “Computational complexity of algebraic functions”

✍ Nicholas Pippenger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 269 KB