A topological analysis of the complexity of computer programs with less than three binary branches

Warren Harrison, Kenneth I. Magel. A topological analysis of the complexity of computer programs with less than three binary branches. SIGPLAN Notices, 16(4):51-63, 1981. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.