NP

  1. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric
  2. Hamiltonian Path

    A Hamiltonian path on a directed graph is a path that visits every node exactly once.

    cloncaric
1-2 of 2
  1. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric
  2. Hamiltonian Path

    A Hamiltonian path on a directed graph is a path that visits every node exactly once.

    cloncaric
1-2 of 2
  1. Hamiltonian Path

    A Hamiltonian path on a directed graph is a path that visits every node exactly once.

    cloncaric
  2. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric
1-2 of 2