Question

What is a good example of an algorithm that is hard to parallelise?

score 70 · Answer 1 · 2026-03-25 22:09:59

70

Views

What is a good example of an algorithm that is hard to parallelise?

Published on 25 Mar 2026 - 22:09

score 361 · Answer 2 · 2026-02-23 10:16:18

361

Views

A decision problem that is Cook-reducible to its complement

Published on 23 Feb 2026 - 10:16

score 567 · Answer 3 · 2015-04-01 12:33:25

567

Views

Is this an NP-Complete problem? (unweighted & undirected graph)

Published on 01 Apr 2015 - 12:33

score 1.1k · Answer 4 · 2015-04-01 21:26:29

1.1k

Views

NP HARD Problem Longest Path in Graph

Published on 01 Apr 2015 - 21:26

score 4.3k · Answer 5 · 2015-04-04 18:49:28

4.3k

Views

Question about NP with certificate

Published on 04 Apr 2015 - 18:49

score 242 · Answer 6 · 2015-04-07 14:57:42

242

Views

If a problem in $P$ can be rewritten to $NPC$, why can this $NPC$ problem not be solved in polynomial time?

Published on 07 Apr 2015 - 14:57

score 973 · Answer 7 · 2015-04-17 20:55:20

973

Views

P vs NP and Countable vs Uncountable Decision Space

Published on 17 Apr 2015 - 20:55

score 204 · Answer 8 · 2015-04-21 03:46:34

204

Views

If $P = NP \cap coNP$, can $P \ne NP$?

Published on 21 Apr 2015 - 3:46

score 4.8k · Answer 9 · 2015-04-22 17:31:41

4.8k

Views

Need help to understand the solution for NP-completness proof (3CNF <= 0-1 integer-programming problem)

Published on 22 Apr 2015 - 17:31

score 32 · Answer 10 · 2015-04-23 23:35:41

32

Views

Given inputs as positive integers $a$,$b$, and $c(i,j)$ where $i,j\leq a$, decide if there is a permutation $\tau$ such that

Published on 23 Apr 2015 - 23:35

score 125 · Answer 11 · 2015-05-01 22:15:08

125

Views

An easy question about NP-hard

Published on 01 May 2015 - 22:15

score 459 · Answer 12 · 2015-05-02 21:10:28

459

Views

Is showing a graph is non-Hamiltonian NP-Complete?

Published on 02 May 2015 - 21:10

score 3k · Answer 13 · 2015-05-03 03:18:42

3k

Views

Given that Minimum Spanning Tree is NP-complete show that Hamiltonian Cycle is NP complete

Published on 03 May 2015 - 3:18

score 1.6k · Answer 14 · 2015-05-10 02:00:34

1.6k

Views

What is the "true" minimum spanning forest of a connected graph?

Published on 10 May 2015 - 2:00

score 1.8k · Answer 15 · 2015-05-13 19:55:41

1.8k

Views

Proving that Unit Intersection is NP-complete

Published on 13 May 2015 - 19:55

List Question

What is a good example of an algorithm that is hard to parallelise?

A decision problem that is Cook-reducible to its complement

Is this an NP-Complete problem? (unweighted & undirected graph)

NP HARD Problem Longest Path in Graph

Question about NP with certificate

If a problem in $P$ can be rewritten to $NPC$, why can this $NPC$ problem not be solved in polynomial time?

P vs NP and Countable vs Uncountable Decision Space

If $P = NP \cap coNP$, can $P \ne NP$?

Need help to understand the solution for NP-completness proof (3CNF <= 0-1 integer-programming problem)

Given inputs as positive integers $a$,$b$, and $c(i,j)$ where $i,j\leq a$, decide if there is a permutation $\tau$ such that

An easy question about NP-hard

Is showing a graph is non-Hamiltonian NP-Complete?

Given that Minimum Spanning Tree is NP-complete show that Hamiltonian Cycle is NP complete

What is the "true" minimum spanning forest of a connected graph?

Proving that Unit Intersection is NP-complete

Trending Questions

Popular # Hahtags

Popular Questions