Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower Bounds on The Complexity of Real-Time Branching Programs."

Klaus Kriegel, Stephan Waack (1988)

> Home

Details and statistics

DOI: 10.1051/ITA/1988220404471

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/KriegelW88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/KriegelW88
Klaus Kriegel, Stephan Waack:
Lower Bounds on The Complexity of Real-Time Branching Programs. RAIRO Theor. Informatics Appl. 22(4): 447-459 (1988)

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.