4
votes
Accepted
Asymptotic behavior of $L^2$ norm for increased matrix dimensions
If you take $\|\cdot\|_2$ to mean the operator $2$-norm (the norm induced by the Euclidean vector norm), then for Hermitian matrices this is just the largest absolute value of an eigenvalue. In your ...
1
vote
Complexity of $Th(\langle \mathbb{Z}; + , 1 \rangle)$ same as $Th(\langle \mathbb{Z}; + \rangle)$?
$\def\Z{\mathbb Z}\DeclareMathOperator\Th{Th}\DeclareMathOperator\lcm{lcm}
\def\E#1{\mathrel{\mathrm E_{#1}}}$Yes, $\Th(\Z,+,1)$ has the same complexity as $\Th(\Z,+)$. This follows from the following ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
computational-complexity × 3576algorithms × 831
computer-science × 586
asymptotics × 390
graph-theory × 269
np-complete × 267
combinatorics × 188
computability × 178
discrete-mathematics × 168
linear-algebra × 159
recurrence-relations × 152
turing-machines × 136
logic × 133
number-theory × 125
matrices × 120
optimization × 116
computational-mathematics × 114
polynomials × 78
recursive-algorithms × 78
reference-request × 64
elementary-number-theory × 63
numerical-methods × 60
probability × 55
logarithms × 53
summation × 52