"On the computational complexity of problems related to distinguishability ..."

Markus Holzer, Sebastian Jakobi (2018)

> Home

Details and statistics

DOI: 10.1016/J.IC.2017.09.003

access: closed

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/HolzerJ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HolzerJ18
Markus Holzer, Sebastian Jakobi:
On the computational complexity of problems related to distinguishability sets. Inf. Comput. 259(2): 225-236 (2018)

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.