List questions from np-complete

Published on 23 Feb 2026 - 16:51

71

Views

Time Complexity and Polynomial Reduction

Published on 26 Aug 2022 - 15:56

91

Views

Variation on the minimum clique cover problem (NP Hard)

Published on 07 Sep 2022 - 11:10

53

Views

Minimum spanning forest, for a complete graph.

Published on 23 Feb 2026 - 16:48

141

Views

Travelling Salesman Problem

Published on 28 Mar 2026 - 17:05

90

Views

Is the Generalized Assignment Problem with weights=1 NP-hard?

Published on 27 Mar 2026 - 17:51

79

Views

Finding independent set in a cubic graph

Published on 14 Oct 2022 - 9:44

197

Views

Does a cubic graph polynomial contain the $x_1 x_2 \cdots x_M$ term?

Published on 27 Mar 2026 - 17:06

68

Views

A version of an algorithm for an "uniform" subset sum problem?

Published on 26 Mar 2026 - 1:00

133

Views

Would a runtime of (n choose (n/2)) be considered polynomial?

Published on 17 Nov 2022 - 18:47

80

Views

Is the problem of the form $ax=b \pmod{n}$, where $\gcd(a,n)\ne 1$, an NP-complete problem?

Published on 05 Dec 2022 - 15:40

315

Views

Vertex coloring approximation algorithm using linear programming

Published on 08 Dec 2022 - 22:16

134

Views

Can protein folding be used to solve SAT problems?

Published on 25 Mar 2026 - 19:16

114

Views

Proof of NP-completeness of the 3-SAT problem

Published on 08 Jan 2023 - 15:25

177

Views

Proving BinPacking is NP-complete given Partition problem is NP-hard

Published on 09 Jan 2023 - 13:13

List Question

Minimum spanning forest, where each tree has the same number of vertices.

Time Complexity and Polynomial Reduction

Variation on the minimum clique cover problem (NP Hard)

Minimum spanning forest, for a complete graph.

Travelling Salesman Problem

Is the Generalized Assignment Problem with weights=1 NP-hard?

Finding independent set in a cubic graph

Does a cubic graph polynomial contain the $x_1 x_2 \cdots x_M$ term?

A version of an algorithm for an "uniform" subset sum problem?

Would a runtime of (n choose (n/2)) be considered polynomial?

Is the problem of the form $ax=b \pmod{n}$, where $\gcd(a,n)\ne 1$, an NP-complete problem?

Vertex coloring approximation algorithm using linear programming

Can protein folding be used to solve SAT problems?

Proof of NP-completeness of the 3-SAT problem

Proving BinPacking is NP-complete given Partition problem is NP-hard

Trending Questions

Popular # Hahtags

Popular Questions