scientific article; zbMATH DE number 838665
From MaRDI portal
Publication:4863883
Recommendations
- scientific article; zbMATH DE number 1445809
- scientific article; zbMATH DE number 51799
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
- scientific article; zbMATH DE number 2075906
Cited in
(11)- Estimating structural complexity of programs
- scientific article; zbMATH DE number 1208123 (Why is no real title available?)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.
- Metrics based optimization of functional source code
- Application of complexity metrics in functional languages
- scientific article; zbMATH DE number 2075906 (Why is no real title available?)
- scientific article; zbMATH DE number 4209557 (Why is no real title available?)
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
- scientific article; zbMATH DE number 4068248 (Why is no real title available?)
- scientific article; zbMATH DE number 1445809 (Why is no real title available?)
- Applying Mccabe's complexity measure to multiple-exit programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863883)