"Two Lower Bounds on Computational Complexity of Infinite Word Generation."

Juraj Hromkovic, Juhani Karhumäki (1994)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2016-03-15

- no documents available
- export record
  dblp key:
  - conf/ifip/HromkovicK94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip/HromkovicK94
Juraj Hromkovic, Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Word Generation. IFIP Congress (1) 1994: 479-484

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.