… Section 2 defines the NP-complete problem that we will use as a source problem. Section 3
… Sections 4, 5, and 6 proves that silt, sand, and stone are NP-complete, respectively. Section …

We prove that the problem STO of deciding whether or not a finite setEof term equations is
subject to occur-check is in NP.Eis subject to occur-check if the execution of the Martelli–…

… subject to the occur-check (STO) if a sequence of actions of the … We prove here that the
problem of deciding whether E is STO… from the known NP-Complete Satisfiability Problem (see eg …

… Structures from the Stone Age can provide unique insights into Late Glacial and Mesolithic
… submerged in the mid-Holocene, preserve Stone Age structures that did not survive on land. …

This research explores the application of a genetic algorithm metaheuristic enriched by the
wisdom of crowds in order to address the NP-Complete matrix domination problem (…

This research explores the application of a genetic algorithm metaheuristic enriched by the
wisdom of crowds in order to address the NP-Complete matrix domination problem (…

… This problem is known to be NP-complete … the Hamiltonian cycle problem for cubic planar
graphs is NP-complete. … the Hamiltonian path problem for cubic planar graphs is NP-complete). …

… that deciding whether a given instance of each puzzle has a solution is NP-complete. …
the publication of this book, the following Nikoli’s pencil puzzles were shown to be NP-complete: …

… Theorem 2 It is NP-complete to decide whether there is a solution to a Yin-Yang puzzle
without the 2×2 constraint, or Grid Graph Connected Partition Completion, on an n × n grid. …

… In order to demonstrate that NPEPE can execute NPEP descriptions we attack the well known
NP-complete “3-colorability” decision problem. The challenge of this problem is to decide …