Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computational-complexity
Search options not deleted
user 11236
This is a branch that includes: computational complexity theory; complexity classes, NP-completeness and other completeness concepts; oracle analogues of complexity classes; complexity-theoretic computational models; regular languages; context-free languages; Komolgorov Complexity and so on.
14
votes
How hard (P, NP, NP-hard) is it to compute Schur norms of matrices (as multipliers)?
It turns out that this norm can be computed efficiently (i.e., it is in $P$). This wasn't known at the time that the Davidson paper (originally linked in a comment above) was written, which is why it …
- 6,351
9
votes
NP-hard problems in linear algebra and real analysis
The tensor product has a way of making easy problems into (NP-)hard problems. Rank of a 2-tensor (matrix)? Easy. Rank of a 3-tensor? NP-hard. Spectral norm of a matrix? Easy. Spectral norm of a 3-tens …
3
votes
Complexity of solving $\sum_i A_i X B_i = C$
This is exactly equivalent to asking the complexity of solving $\Phi(X) = C$, where $\Phi$ is a linear transformation acting on the vector space of $d \times d$ matrices. Since that vector space is $d …
- 6,351
3
votes
0
answers
359
views
Do Isometry Groups Tell Us How Difficult Norms are to Compute?
The question: Consider two norms N1 and N2 on the space of n-by-n complex matrices. N1 and N2 have the same isometry group and computing N1 is NP-HARD. Does it follow that computing N2 is NP-HARD as w …
- 6,351