"On Complexity of Searching a Subset of Vectors with Shortest Average Under ..."

Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-319-52920-2_5

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aist/EremeevKP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aist/EremeevKP16
Anton V. Eremeev, Alexander V. Kel'manov, Artem V. Pyatkin:
On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. AIST 2016: 51-57

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.