"Some Computable Complexity Measures for Binary Sequences."

Harald Niederreiter (1998)

> Home

Details and statistics

DOI: 10.1007/978-1-4471-0551-0_5

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/seta/Niederreiter98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/seta/Niederreiter98
Harald Niederreiter:
Some Computable Complexity Measures for Binary Sequences. SETA 1998: 67-78

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.