Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A study of the applicability of complexity measures

From MaRDI portal
Publication:4711614
Jump to:navigation, search

DOI10.1109/32.6179zbMath0825.68408OpenAlexW1997941062MaRDI QIDQ4711614

Stephen John Davis, Richard J. jun. LeBlanc

Publication date: 25 June 1992

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/32.6179



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (2)

The structured complexity of object-oriented programs ⋮ Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.







This page was built for publication: A study of the applicability of complexity measures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4711614&oldid=11989724"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki