Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis.
Tomoyuki YamakamiPublished in: CoRR (2022)
Keyphrases
- linear space
- combinatorial problems
- constraint programming
- combinatorial optimization
- space efficient
- constraint satisfaction problems
- metaheuristic
- traveling salesman problem
- nearest neighbor search
- branch and bound algorithm
- phase transition
- external memory
- constraint satisfaction
- arbitrary shape
- neural network
- global constraints
- simulated annealing
- search space
- worst case