Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty

Details Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty

2009-08-10

arxiv.org/abs/0908.1397v3

Computer Science

Computational Complexity

12 pages

Scientific paper

We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty) including p = 1, 2, unless P = NP, there is no polynomial-time algorithm approximates the \infty, p mixed norm to some fixed relative precision.

Affiliated with

Also associated with

No associations

Rating

Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164004