New complexity indices based on edge covers (original) (raw)
Related papers
Note to readers: This is the English version of an article that has been translated into Spanish and published online with slight modifications (see http://dia.austral.edu.ar/Complejidad). This version is for personal use only; if you wish to cite the Spanish version but do not read Spanish, please contact me to confirm that your citation is accurate. About the content: this article is a non-technical overview of complexity science written by a non-specialist for an audience of non-specialists. As the online version will be updated and revised periodically, any feedback that might help to improve this article would be greatly appreciated.
Measuring complexity with zippers
European Journal of Physics - EUR J PHYS, 2005
Physics concepts have often been borrowed and independently developed by other fields of science. In this perspective, a significant example is that of the entropy in information theory. The aim of this paper is to provide a short and pedagogical introduction to the use of data compression techniques for the estimate of the entropy and other relevant quantities in information theory and algorithmic information theory. We consider in particular the LZ77 algorithm as a case study and discuss how a zipper can be used for information extraction.
IEEE Transactions on Software Engineering, 1976
This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to iUustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graphtheoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
Complexity Reduction: theory, metrics and applications
2007 IEEE International Conference on Research, Innovation and Vision for the Future, 2007
Generalized Galois Lattices Formalism for computing As a matter of fact, as noticed by [3], we do not have a contextual categorization allows metrics to evaluate complexity scientific definition of complexity. For some authors , and efficiency as well as methods for simplifying or complicating the term "complexity" is generally avoided as an overused and the external object at hand. Such methods are adapted for virtual environments and augmented reality devices for which it is poorly defined word, except in specific systems. They simple to change the distribution of features over categories. For advocate in favor of terms such as "diversity" or real world objects, and human operators that operate on them, "complication", and are using "complexity" for real nonthe online computation allows a survey of the complexity level modeled world entities. and a "simplify it first" planning of operations. Let's consider however scientific definitions such as 1-4244-0695-1/07/$25.00 ©2007 IEEE.
Complexity analysis of key building blocks–first version
Page 1. IST-2001-32620 MATRICE D5.2a Complexity analysis of key building blocks – first version Contractual Date of Delivery to the CEC: 30/09/2003 Actual Date of Delivery to the CEC: 30/09/2003 Author(s): Laurent Chalard, Friedbert Berens, Rui L. Aguiar, V. Monteiro, A. Gameiro, Naaser Neda, Jonathan Rodriguez , Pierre Penard Participant(s): STM, IT, UniS, FT Workpackage: WP5 Est. person months: Security: Pub.
On modification of the relative complexity metric
Microelectronics Reliability, 1996
Software reliability and software complexity are closely related issues in software development, An elegant definition of relative complexity was proposed in [l, 2]. The definition given in [I, 2] needs modification. Depending on how many factor loadings are used in the factor analysis different complexity results are obtained. Hence the definition of relative complexity given in those papers is subjective. The object of this paper is to suggest a modified definition of relative complexity. Different measures based on the magnitude of the eigenvalues obtained from the correlation matrix are suggested in this paper. The relative complexity of 27 programs given in [3] has been calculated using different factor Ioadings.