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 43 · Answer 1 · 2019-06-08 14:49: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 156 · Answer 2 · 2019-06-08 22:29:37

156

Views

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

Published on 08 Jun 2019 - 22:29

score 245 · Answer 3 · 2019-06-13 21:30:53

245

Views

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

Published on 13 Jun 2019 - 21:30

score 343 · Answer 4 · 2019-06-14 20:17:46

343

Views

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

Published on 14 Jun 2019 - 20:17

score 190 · Answer 5 · 2019-06-23 19:29:05

190

Views

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

Published on 23 Jun 2019 - 19:29

score 1.4k · Answer 6 · 2026-03-25 01:37:33

1.4k

Views

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

Published on 25 Mar 2026 - 1:37

score 853 · Answer 7 · 2026-03-22 20:41:42

853

Views

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

Published on 22 Mar 2026 - 20:41

score 191 · Answer 8 · 2019-06-30 01:44:16

191

Views

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

Published on 30 Jun 2019 - 1:44

score 1.3k · Answer 9 · 2026-03-25 01:24:17

1.3k

Views

Boolean Polynomial

Published on 25 Mar 2026 - 1:24

score 163 · Answer 10 · 2026-02-23 06:39:36

163

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 23 Feb 2026 - 6:39

score 154 · Answer 11 · 2019-07-07 19:26:05

154

Views

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

Published on 07 Jul 2019 - 19:26

score 92 · Answer 12 · 2019-07-11 21:00:47

92

Views

Minimum Number of Lines to Connect People, NP hard?

Published on 11 Jul 2019 - 21:00

score 501 · Answer 13 · 2019-07-31 22:21:28

501

Views

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

Published on 31 Jul 2019 - 22:21

score 229 · Answer 14 · 2019-08-01 14:03:13

229

Views

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

Published on 01 Aug 2019 - 14:03

score 43 · Answer 15 · 2019-08-07 17:14:04

43

Views

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

Published on 07 Aug 2019 - 17:14

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