کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4602595 | 1631171 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Permuted max-algebraic eigenvector problem is NP-complete
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Let a⊕b=max(a,b) and a⊗b=a+b for and extend these operations to matrices and vectors as in conventional linear algebra. The following eigenvector problem has been intensively studied in the past: Given find all (eigenvectors) such that A⊗x=λ⊗x for some The present paper deals with the permuted eigenvector problem: Given and is it possible to permute the components of x so that it becomes a (max-algebraic) eigenvector of A? Using a polynomial transformation from BANDWIDTH we prove that the integer version of this problem is NP-complete.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 428, Issues 8–9, 15 April 2008, Pages 1874-1882
Journal: Linear Algebra and its Applications - Volume 428, Issues 8–9, 15 April 2008, Pages 1874-1882