Water-Based Metaheuristics: How Water Dynamics Can Help Us to Solve NP-Hard Problems

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

How to solve NP-hard graph problems on lique-width bounded graphs in polynomial time

Metaheuristics can Solve

In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this stochastic searchbased algorithm, which uses simulated annealing, is able to complete logic-solvable puzzle-instances that feature daily in many of the UK’s national newspapers. We also introduce a new method for producing ...

In Some Curved Spaces, One Can Solve NP-Hard Problems in Polynomial Time

In the late 1970s and the early 1980s, Yuri Matiyasevich actively used his knowledge of engineering and physical phenomena to come up with parallelized schemes for solving NP-hard problems in polynomial time. In this paper, we describe one such scheme in which we use parallel computation in curved spaces.

Water Scarcity Induced Migration: How Far Watershed Projects Can Help?