Fixstars Amplify is used to solve the 14 NP problems presented in the paper, A. Lucas, Front. Phys. (2014).

Tutorials (applied)

Difficulty level

Given a single Boolean formula, it may be possible to make the value of the formula true by successfully determining the values of the variables in it. The satisfiability problem determines this, and we will solve a problem called 3-SAT.

Tutorials (applied)

Difficulty level

In this tutorial, we will find a subset of the edges of a given graph where the edges in the subset are not adjacent to each other, and the edges not in the subset are always adjacent to the edges in the subset, with the fewest elements.

Tutorials (applied)

Difficulty level

Given a directed graph, a directed feedback vertex set is a subset of graph vertices such that the closed path of any graph passes through at least one vertex in the subset. The directed feedback vertex set problem seeks to find a set with the fewest elements.

Tutorials (applied)

Difficulty level

Given a directed graph, a feedback edge set is a subset of graph edges where every closed path contains at least one edge in this subset. The minimum feedback edge set problem searches for a feedback edge set with the fewest elements.

Tutorials (applied)

Difficulty level

Two given graphs are said to be isomorphic if there is a one-to-one correspondence between their vertices and if the two corresponding vertices are both connected by an edge. It is generally challenging to determine isomorphism, but this example program tackles this problem.