Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A topological analysis of the complexity of computer programs with less ..."

Warren Harrison, Kenneth I. Magel (1981)

> Home

Details and statistics

DOI: 10.1145/988131.988137

access: closed

type: Journal Article

metadata version: 2021-08-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/sigplan/HarrisonM81a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigplan/HarrisonM81a
Warren Harrison, Kenneth I. Magel:
A topological analysis of the complexity of computer programs with less than three binary branches. ACM SIGPLAN Notices 16(4): 51-63 (1981)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.