## New answers tagged computational-complexity

1

That GANs are both inspired and conceptually linked with Mathematical Game Theory is undeniable.
From the initial Goodfellow' s model quite a lot of water has been running under the mill. Many different variants of GAN has been proposed (and implemented), some of those less obviously coupled to the standard paradigm of zero sum two-players game.*
However, ...

0

### Fast inverse of asymmetric diagonally dominant matrix with diagonal 1 and non-positive off-diagonals

Unfortunately there is no magic bullet method (apart from general Strassen-type algorithms that usually do not pay out in practice). Or, at least, if it existed, many of my colleagues and I would be surprised and happy to know about it. :)
You can truncate the Neumann series $A^{-1} = I + M + M^2 + \dots$, but this is going to be a poor approximation unless $...

Top 50 recent answers are included

#### Related Tags

computational-complexity × 1152algorithms × 207

co.combinatorics × 202

graph-theory × 180

nt.number-theory × 125

computer-science × 112

lo.logic × 106

computability-theory × 93

reference-request × 85

np × 67

linear-algebra × 49

computational-number-theory × 47

gr.group-theory × 40

combinatorial-optimization × 33

ag.algebraic-geometry × 30

oc.optimization-and-control × 30

polynomials × 27

matrices × 25

pr.probability × 24

graph-colorings × 23

approximation-algorithms × 22

prime-numbers × 21

discrete-geometry × 19

integer-programming × 19

linear-programming × 18