"Polynomial-Time Approximation Scheme for a Problem of Searching for the ..."

Vladimir I. Khandeev (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-40616-5_36

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/numta/Khandeev19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/numta/Khandeev19
Vladimir I. Khandeev:
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. NUMTA (2) 2019: 400-405

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.