"The NP-hard problem of computing the maximal sample variance over interval ..."

Miroslav Rada, Michal Cerný, Ondrej Sokol (2024)

> Home

Details and statistics

DOI: 10.1007/S00037-024-00254-3

access: closed

type: Journal Article

metadata version: 2024-07-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/RadaCS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/RadaCS24
Miroslav Rada, Michal Cerný, Ondrej Sokol:
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability. Comput. Complex. 33(2): 8 (2024)

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.