"Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and ..."

Gerhard Heindl, Vladik Kreinovich, Anatoly V. Lakeyev (1998)

> Home

Details and statistics

DOI: 10.1023/A:1024423917616

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/HeindlKL98a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rc/HeindlKL98a
Gerhard Heindl, Vladik Kreinovich, Anatoly V. Lakeyev:
Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow. Reliab. Comput. 4(4): 383-388 (1998)

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.