Matching works

1 work

math.RT — Representation Theory

The inverse quiver problem is NP-complete

Contributed by Paul, Marin, Pierre Coutant--Denord

We prove that the inverse quiver problem is NP-complete. We also present a new proof that the quiver problem is NP-complete. We present a way to translate arithmetical/algebraic geometry problems in terms of (inverse) quiver problem.

Primarily human-written textHuman understanding: all partsQuiver representation

Advanced search

Text
Human understanding
Linked formalizations