"A bright side of NP-hardness of interval computations: interval heuristics ..."

Bonnie Traylor, Vladik Kreinovich (1995)

> Home

Details and statistics

DOI: 10.1007/BF02385263

access: closed

type: Journal Article

metadata version: 2020-04-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rc/TraylorK95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rc/TraylorK95
Bonnie Traylor, Vladik Kreinovich:
A bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems. Reliab. Comput. 1(3): 343-359 (1995)

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.