Any finite combinatorial problem with a known logical circuit can be encoded as a tensor network whose contraction defines an explicit, though generally inefficient, solution equation.
The n-queens problem, 2021
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.ET 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
Any finite combinatorial problem with a known logical circuit can be encoded as a tensor network whose contraction defines an explicit, though generally inefficient, solution equation.