Question

What is the optimal way to explore the planets in Master of Orion? (Maximize $\sum_{v\in T}r(v)$ where $|T|=n$ and $T\supset S$.)

score 46 · Answer 1 · 2026-04-14 11:16:50

What is the optimal way to explore the planets in Master of Orion? (Maximize $\sum_{v\in T}r(v)$ where $|T|=n$ and $T\supset S$.)

score 162 · Answer 2 · 2026-05-10 22:09:29

162

Views

NP-Complete proof of deciding if a graph has another Hamiltonian Circuit

Published on 10 May 2026 - 22:09

score 248 · Answer 3 · 2026-04-14 10:22:55

248

Views

Why is the following algorithm for K-CLIQUE not in NL?

Published on 14 Apr 2026 - 10:22

score 345 · Answer 4 · 2026-04-16 12:27:06

345

Views

What's the effect on other complexity classes if P=L?

Published on 16 Apr 2026 - 12:27

score 194 · Answer 5 · 2026-05-10 15:55:53

194

Views

NP-completeness of chromatic sum in list coloring problem with capacity constraints

Published on 10 May 2026 - 15:55

score 1.4k · Answer 6 · 2026-03-26 04:49:31

1.4k

Views

Proving NP-completeness for a problem is a generalization of a known NP-complete problem

Published on 26 Mar 2026 - 4:49

score 854 · Answer 7 · 2026-03-25 12:32:40

854

Views

Proving the Optimization version of a problem is also NP-hard

Published on 25 Mar 2026 - 12:32

score 194 · Answer 8 · 2026-04-14 05:29:41

194

Views

Can optimization version problem whose decision version is NP-complete be solved in poly-time iff P=NP?

Published on 14 Apr 2026 - 5:29

score 1.3k · Answer 9 · 2026-05-10 17:55:29

1.3k

Views

Boolean Polynomial

Published on 10 May 2026 - 17:55

score 165 · Answer 10 · 2026-05-10 19:18:40

165

Views

does checking if a matrix can have at least one positive number at each row by negation of columns a NP-complete problem?

Published on 10 May 2026 - 19:18

score 157 · Answer 11 · 2026-04-10 22:10:12

157

Views

Can the unbounded knapsack problem (UKP) be solved efficiently when the weights equal the values?

Published on 10 Apr 2026 - 22:10

score 95 · Answer 12 · 2026-04-13 22:01:04

95

Views

Minimum Number of Lines to Connect People, NP hard?

Published on 13 Apr 2026 - 22:01

score 504 · Answer 13 · 2026-04-13 18:07:18

504

Views

The polynomial algorithm to show that the Partition Problem belongs to the class of NP

Published on 13 Apr 2026 - 18:07

score 234 · Answer 14 · 2026-05-10 13:50:16

234

Views

Does the problem of P vs NP come under the category of Operational Research?

Published on 10 May 2026 - 13:50

score 46 · Answer 15 · 2026-04-16 11:42:43

46

Views

Paradoxon concerning the total amount of cliques in a worst-case graph

Published on 16 Apr 2026 - 11:42

List Question

What is the optimal way to explore the planets in Master of Orion? (Maximize $\sum_{v\in T}r(v)$ where $|T|=n$ and $T\supset S$.)

NP-Complete proof of deciding if a graph has another Hamiltonian Circuit

Why is the following algorithm for K-CLIQUE not in NL?

What's the effect on other complexity classes if P=L?

NP-completeness of chromatic sum in list coloring problem with capacity constraints

Proving NP-completeness for a problem is a generalization of a known NP-complete problem

Proving the Optimization version of a problem is also NP-hard

Can optimization version problem whose decision version is NP-complete be solved in poly-time iff P=NP?

Boolean Polynomial

does checking if a matrix can have at least one positive number at each row by negation of columns a NP-complete problem?

Can the unbounded knapsack problem (UKP) be solved efficiently when the weights equal the values?

Minimum Number of Lines to Connect People, NP hard?

The polynomial algorithm to show that the Partition Problem belongs to the class of NP

Does the problem of P vs NP come under the category of Operational Research?

Paradoxon concerning the total amount of cliques in a worst-case graph

Trending Questions

Popular # Hahtags

Popular Questions