article

Free access

Sorting out software complexity

Author:

Robert L. GlassAuthors Info & Claims

Communications of the ACM, Volume 45, Issue 11

Pages 19 - 21

https://doi.org/10.1145/581571.581584

Published: 01 November 2002 Publication History

All formats PDF

Abstract

Underlying complexity escalates exponentially: some little-known research findings.

References

[1]

Glass, R.L. Software Creativity. Prentice-Hall, 1995. See section 2.6, "Intellectual vs. Clerical Tasks," for research findings about the difficulty of solving problems in software.

Digital Library

Google Scholar

[2]

Glass, R.L. Building Quality Software. Prentice-Hall, 1992. A reference to the "50 times" finding appears on page 55.

Digital Library

Google Scholar

[3]

Woodfield, S.N. An experiment on unit increase in problem complexity. IEEE Transactions on Software Engineering (Mar. 1979). The source of the 25%-->100% finding.

Google Scholar

Cited By

View all

Washizaki HXia TKamata NFukazawa YKanuka HKato TYoshino MOkubo TOgata SKaiya HHazeyama ATanaka TYoshioka NPriyalakshmi G(2021)Systematic Literature Review of Security Pattern ResearchInformation10.3390/info1201003612:1(36)Online publication date: 16-Jan-2021
https://doi.org/10.3390/info12010036
Washizaki HGuéhéneuc YKhomh F(2018)ProMeTAEmpirical Software Engineering10.1007/s10664-017-9592-323:4(2323-2358)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s10664-017-9592-3
Yigitbasioglu O(2017)Drivers of management accounting adaptability: the agility lensJournal of Accounting & Organizational Change10.1108/JAOC-12-2015-009213:2(262-281)Online publication date: 5-Jun-2017
https://doi.org/10.1108/JAOC-12-2015-0092
Show More Cited By

Index Terms

Sorting out software complexity
1. General and reference
  1. Cross-computing tools and techniques
    1. Metrics

Recommendations

The VLSI Complexity of Sorting

The area-time complexity of sorting is analyzed under an updated model of VLSI computation. The new model makes a distinction between "processing" circuits and "memory" circuits; the latter are less important since they are denser and consume less ...
The Landscape of Communication Complexity Classes

We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between $${\mathsf{P}}$$P and $${\mathsf{PSPACE}}$$PSPACE, short of proving lower bounds ...
Separating Complexity Classes Using Autoreducibility

A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from exponential space by showing that all Turing complete sets ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 45, Issue 11

November 2002

97 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/581571

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2002

Published in CACM Volume 45, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
1,003
Total Downloads

Downloads (Last 12 months)126
Downloads (Last 6 weeks)30

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Washizaki HXia TKamata NFukazawa YKanuka HKato TYoshino MOkubo TOgata SKaiya HHazeyama ATanaka TYoshioka NPriyalakshmi G(2021)Systematic Literature Review of Security Pattern ResearchInformation10.3390/info1201003612:1(36)Online publication date: 16-Jan-2021
https://doi.org/10.3390/info12010036
Washizaki HGuéhéneuc YKhomh F(2018)ProMeTAEmpirical Software Engineering10.1007/s10664-017-9592-323:4(2323-2358)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s10664-017-9592-3
Yigitbasioglu O(2017)Drivers of management accounting adaptability: the agility lensJournal of Accounting & Organizational Change10.1108/JAOC-12-2015-009213:2(262-281)Online publication date: 5-Jun-2017
https://doi.org/10.1108/JAOC-12-2015-0092
Antinyan VStaron MSandberg A(2017)Evaluating code complexity triggers, use of complexity measures and the influence of code complexity on maintenance timeEmpirical Software Engineering10.1007/s10664-017-9508-222:6(3057-3087)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s10664-017-9508-2
Washizaki HGueheneuc YKhomh F(2016)A Taxonomy for Program Metamodels in Program Reverse Engineering2016 IEEE International Conference on Software Maintenance and Evolution (ICSME)10.1109/ICSME.2016.82(44-55)Online publication date: Oct-2016
https://doi.org/10.1109/ICSME.2016.82
Dingel J(2016)Complexity is the Only Constant: Trends in Computing and Their Relevance to Model Driven EngineeringGraph Transformation10.1007/978-3-319-40530-8_1(3-18)Online publication date: 22-Jun-2016
https://doi.org/10.1007/978-3-319-40530-8_1
Colazo J(2015)The interplay among software volatility, complexity and development outcomesInternational Journal of Information Technology and Management10.1504/IJITM.2015.06846214:2/3(160-171)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1504/IJITM.2015.068462
Unterkalmsteiner MFeldt RGorschek T(2014)A taxonomy for requirements engineering and software test alignmentACM Transactions on Software Engineering and Methodology10.1145/252308823:2(1-38)Online publication date: 4-Apr-2014
https://dl.acm.org/doi/10.1145/2523088
Yan DAhmad SYang D(2013)Matthew effect, ABC analysis and project management of scale-free information systemsJournal of Systems and Software10.1016/j.jss.2012.08.01386:2(247-254)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.jss.2012.08.013
Štuikys VDamaševičius RŠtuikys VDamaševičius R(2012)Complexity Evaluation of Feature Models and Meta-ProgramsMeta-Programming and Model-Driven Meta-Program Development10.1007/978-1-4471-4126-6_12(209-237)Online publication date: 7-Jun-2012
https://doi.org/10.1007/978-1-4471-4126-6_12
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

The VLSI Complexity of Sorting

The Landscape of Communication Complexity Classes

Separating Complexity Classes Using Autoreducibility

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Magazine Site

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations