ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Computing the cube of an interval matrix is NP-Hard

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Olga Kosheleva University of Texas at El Paso El Paso, TX
Vladik Kreinovich University of Texas at El Paso El Paso, TX
Günter Mayer Universität Rostock, Rostock, Germany
Hung T. Nguyen New Mexico State University, Las Cruces, NM
Computing the cube of an interval matrix is NP-Hard Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 9
· Citation Count: 0

Published in:
Cover Image
 
· Proceeding
SAC '05 Proceedings of the 2005 ACM symposium on Applied computing
ACM New York, NY, USA ©2005
table of contents ISBN:1-58113-964-0 doi>10.1145/1066677.1067007

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder