Abstract
This article takes an axiomatic approach to defining program complexity using complexity rankings and measures. A complexity ranking is an abstract, qualitative comparison between programs that is approximated by a complexity measure on each program. A set of axioms are stated and a classification scheme is presented with properties of each class. This is extended a series of properties developed by Weyuker. The formal model has many applications, including evaluating and classifying existing complexity measures and serving as criteria for complexity measure selection.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
