Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SAC
/
Paper
Computing the cube of an interval matrix is NP-Hard.
Olga Kosheleva
,
Vladik Kreinovich
,
Gnter Mayer
,
Hung T. Nguyen
Venue
Multiconference
SAC
Year
2005
Proceedings
SAC
DBLP record
conf/sac/KoshelevaKMN05 ↗
Browse the full
SAC paper archive
.