A Complexity Measure
From MaRDI portal
Publication:4122801
DOI10.1109/TSE.1976.233837zbMath0352.68066WikidataQ29011626 ScholiaQ29011626MaRDI QIDQ4122801
Publication date: 1976
Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Related Items (49)
Measuring prime program complexity ⋮ An entropy based measure for comparing distributions of complexity ⋮ Semi-automatic grammar recovery ⋮ Design, implementation and evolution of object oriented frameworks: concepts and guidelines ⋮ The servicisation of the cutting tool supply chain ⋮ A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS ⋮ Project for intercomparison of landsurface parameterization schemes: Application of some structural complexity metrics ⋮ The subprogram problem for software metric design ⋮ Quantification of software code coverage using artificial bee colony optimization based on Markov approach ⋮ On the detection of unstructuredness in flowgraphs ⋮ Why there is no general solution to the problem of software verification ⋮ Software defect prediction model based on distance metric learning ⋮ Multiscale horizontal visibility entropy: measuring the temporal complexity of financial time series ⋮ The structured complexity of object-oriented programs ⋮ Choosing the best model: Level of detail, complexity, and model performance ⋮ Divergent exploration in design with a dynamic multiobjective optimization formulation ⋮ Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques ⋮ Survey questionnaires and graphs ⋮ Partial Evaluation for Java Malware Detection ⋮ On the estimation of the parameters for the Littlewood model in software reliability ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ Formalization of structural test cases coverage criteria for quantum software testing ⋮ Cyclomatic numbers do not measure complexity of unstructured programs ⋮ Analysis of high structural class coupling in object-oriented software systems ⋮ On the number of cycles in a graph ⋮ FEVS: a functional equivalence verification suite for high-performance scientific computing ⋮ Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. ⋮ Partition refinement of component interaction automata ⋮ Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ Algorithmic complexity of recursive and inductive algorithms ⋮ Partial evaluation of string obfuscations for Java malware detection ⋮ Computing ripple effect for software maintenance ⋮ An efficient method to generate feasible paths for basis path testing ⋮ Complexity measures for concurrent programs based on information- theoretic metrics ⋮ A generalized mathematical theory of structured programming ⋮ Measures for Evaluating the Software Agent Pro-Activity ⋮ Unnamed Item ⋮ The design of decision trees in the framework of granular data and their application to software quality models ⋮ Flowchart recognition—a syntactic approach ⋮ Complexity of Leading Digit Sequences ⋮ Software Defect Classification: A Comparative Study of Rough-Neuro-fuzzy Hybrid Approaches with Linear and Non-linear SVMs ⋮ Control flow graphs and code coverage ⋮ Reading beside the lines: Using indentation to rank revisions by complexity ⋮ Evaluation method of software reliability based on SPN model ⋮ Obfuscation Combiners ⋮ Using the Support Vector Machine as a Classification Method for Software Defect Prediction with Static Code Metrics ⋮ String patterns of leading digits ⋮ Complexity of node coverage games
This page was built for publication: A Complexity Measure
