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 88133
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.
1
vote
Examples of ubiquitous objects that are hard to find?
Explicit tensors or polynomials of general rank.
The Waring rank of a general polynomial (meaning, general coefficients), in a given number of variables and of a given degree, has been known since 1 …
0
votes
Question about polynomials over finite fields
The condition clearly implies $|A|=|B|$. (Fix a line $\ell$ and sum over all univariate polynomials on $\ell$.) Also, if $A$ and $B$ satisfy the condition and $p=p(x,y)$ is any bivariate polynomial of …
- 6,237
12
votes
What is the largest tensor rank of $n \times n \times n$ tensor?
For tensors in $\mathbb{R}^3 \otimes \mathbb{R}^3 \otimes \mathbb{R}^3$ or in $\mathbb{C}^3 \otimes \mathbb{C}^3 \otimes \mathbb{C}^3$, the maximum rank is $5$. See Bremner, Hu, On Kruskal's theorem t …
- 6,237