# Tag Archives: NP Complete

Prerequisites: NP-Completeness, NP Class, Max2SAT, 3SAT Problem: Given a 2-CNF (Conjunctive Normal Form) Boolean expression (with m clauses, n variables) and an integer k, Decide… Read More
Prerequisite: NP-Completeness, NP Class, SAT  Problem– The Almost-SAT problem which is built on top of SAT(Boolean Satisfiability Problem) problem takes a boolean formula in conjunctive… Read More
Prerequisite: NP-Completeness, NP Class, Clique Problem: Given an undirected graph G = (V, E) and an integer K, determine if there is a kite subgraph… Read More
Prerequisite: NP-Completeness, NP Class, Sparse Graph, Independent Set Problem: Given graph G = (V, E) and two integers a and b. A set of a… Read More
Prerequisite: NP-Completeness, NP Class, Clique, Independent Set Problem: Given an undirected graph G = (V, E) and an integer K, determine if a clique of… Read More
Prerequisites: NP-Completeness, NP Class, Dense Subgraph  Problem: Given graph G = (V, E) and two integers a and b. A set of a number of… Read More
In computer science, there exist some problems whose solutions are not yet found, the problems are divided into classes known as Complexity Classes. In complexity… Read More
Prerequisite: NP-Completeness, Subset Sum Problem Subset Sum Problem: Given N non-negative integers a1…aN and a target sum K, the task is to decide if there… Read More
Optimized Longest Path Problem: The optimized longest path problem states that given a graph G, of a set of vertices V and edges E, the… Read More
4-SAT Problem: 4-SAT is a generalization of 3-SAT(k-SAT is SAT where each clause has k or fewer literals). Problem Statement: Given a formula f in… Read More
Problem: Given 3 points a, b, c, the task is to check if these three points are collinear. Explanation: An instance of the problem is… Read More
Subset Equality Problem: Given a set S of non-negative integer values, the problem is to identify if there is a partition of the set S… Read More
SAT Problem: SAT(Boolean Satisfiability Problem) is the problem of determining if there exists an interpretation that satisfies a given boolean formula. It asks whether the… Read More
Problem Statement: Given a formula f, the problem is to determine if f has two satisfying assignments. Explanation: An instance of the problem is an… Read More
Prerequisite: NP Complete Problem: Given a ground set X of elements and also a grouping collection C of subsets available in X and an integer… Read More