"Complexity and Approximation for Discriminating and Identifying Code ..."

Sanjana Dey et al. (2023)

> Home

Details and statistics

DOI: 10.1007/S00453-022-01073-0

access: closed

type: Journal Article

metadata version: 2023-06-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DeyFNS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DeyFNS23
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85(7): 1850-1882 (2023)

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.