Question

Why is there, for every language L in NP, a Turing machine with polynomial memory that also accepts L?

score 129 · Answer 1 · 2026-03-18 23:55:13

129

Views

Why is there, for every language L in NP, a Turing machine with polynomial memory that also accepts L?

Published on 18 Mar 2026 - 23:55

score 322 · Answer 2 · 2015-10-25 14:17:07

322

Views

Is $P=NP$ an $NP$-complete problem?

Published on 25 Oct 2015 - 14:17

score 143 · Answer 3 · 2026-03-23 18:49:34

143

Views

How to prove the problem is in NP?

Published on 23 Mar 2026 - 18:49

score 273 · Answer 4 · 2015-10-29 16:25:52

273

Views

How to prove that problem is NP-hard by making a reduction?

Published on 29 Oct 2015 - 16:25

score 897 · Answer 5 · 2015-11-09 19:15:22

897

Views

Is it necessary for hamiltonian cycle to cover all the vertices of the graph??

Published on 09 Nov 2015 - 19:15

score 358 · Answer 6 · 2015-11-10 14:54:51

358

Views

Traveling Salesman with exceptions

Published on 10 Nov 2015 - 14:54

score 757 · Answer 7 · 2026-02-26 10:29:58

757

Views

What the proof, instance, and verifier mean in the definition of NP problem?

Published on 26 Feb 2026 - 10:29

score 2.3k · Answer 8 · 2015-11-18 21:19:11

2.3k

Views

Why is triangle $\in P$ (P/NP)

Published on 18 Nov 2015 - 21:19

score 9.3k · Answer 9 · 2026-03-20 23:51:12

9.3k

Views

Can any NP-Complete problem can be reduced to any other NP-Complete problem in polynomial time?

Published on 20 Mar 2026 - 23:51

score 79 · Answer 10 · 2015-12-01 03:58:44

79

Views

How do we decide a problem is in NP, but not in P or NPC?

Published on 01 Dec 2015 - 3:58

score 183 · Answer 11 · 2015-12-02 17:31:35

183

Views

Explaining Method of Pessimistic Estimators to Students

Published on 02 Dec 2015 - 17:31

score 608 · Answer 12 · 2015-12-10 00:30:55

608

Views

Scheduling problem on bipartite graph

Published on 10 Dec 2015 - 0:30

score 205 · Answer 13 · 2026-03-06 16:24:24

205

Views

A query about reducting SAT to 3SAT when there are more than 3 literals in a clause

Published on 06 Mar 2026 - 16:24

score 372 · Answer 14 · 2015-12-19 07:49:48

372

Views

Formula for all possible sums of a binary sequence

Published on 19 Dec 2015 - 7:49

score 1.9k · Answer 15 · 2015-12-29 19:43:02

1.9k

Views

Is there any significant consequence if P does not equal NP-complete?

Published on 29 Dec 2015 - 19:43

List Question

Why is there, for every language L in NP, a Turing machine with polynomial memory that also accepts L?

Is $P=NP$ an $NP$-complete problem?

How to prove the problem is in NP?

How to prove that problem is NP-hard by making a reduction?

Is it necessary for hamiltonian cycle to cover all the vertices of the graph??

Traveling Salesman with exceptions

What the proof, instance, and verifier mean in the definition of NP problem?

Why is triangle $\in P$ (P/NP)

Can any NP-Complete problem can be reduced to any other NP-Complete problem in polynomial time?

How do we decide a problem is in NP, but not in P or NPC?

Explaining Method of Pessimistic Estimators to Students

Scheduling problem on bipartite graph

A query about reducting SAT to 3SAT when there are more than 3 literals in a clause

Formula for all possible sums of a binary sequence

Is there any significant consequence if P does not equal NP-complete?

Trending Questions

Popular # Hahtags

Popular Questions