List questions from np-complete

Published on 15 Nov 2017 - 20:57

643

Views

Prove NP completness using reduction to Vertex Cover

Published on 16 Nov 2017 - 11:29

442

Views

Why is a directed graph not NP complete

Published on 28 Nov 2017 - 6:33

657

Views

Why is an Accepting NFA in NL

Published on 28 Nov 2017 - 8:20

2k

Views

Reasons to believe that P is not equal to NP.

Published on 02 Dec 2017 - 15:15

67

Views

P class definition in Garey and Johnson's Computers and Intractability

Published on 07 Dec 2017 - 0:05

84

Views

Solve using time hierarchy

Published on 08 Dec 2017 - 6:20

43

Views

Reductions in Algorithms

Published on 17 Dec 2017 - 7:17

85

Views

Shortest Common String Problem is NP

Published on 17 Dec 2017 - 7:28

391

Views

Intersection of two NP-hard languages is coNP-complete

Published on 17 Dec 2017 - 14:14

39

Views

GRAPHCONTRACTIBILITY is NP-complete

Published on 18 Dec 2017 - 13:35

975

Views

showing Triangle vertex cover is NP Hard

Published on 21 Dec 2017 - 11:40

119

Views

Is this graph theory/set theory problem NP-complete?

Published on 23 Dec 2017 - 14:52

23

Views

When the running time of a smallest grammar algorithm is $O(|\Sigma|^{\log_2(|s|)})$ for input $s$.

Published on 29 Dec 2017 - 21:57

140

Views

$P = NP\text{ if and only if } \exists p \in NP-\text{ complete such that } p \in P$

Published on 04 Jan 2018 - 12:09

List Question

Can this problem be solved in polynomial time?

Prove NP completness using reduction to Vertex Cover

Why is a directed graph not NP complete

Why is an Accepting NFA in NL

Reasons to believe that P is not equal to NP.

P class definition in Garey and Johnson's Computers and Intractability

Solve using time hierarchy

Reductions in Algorithms

Shortest Common String Problem is NP

Intersection of two NP-hard languages is coNP-complete

GRAPHCONTRACTIBILITY is NP-complete

showing Triangle vertex cover is NP Hard

Is this graph theory/set theory problem NP-complete?

When the running time of a smallest grammar algorithm is $O(|\Sigma|^{\log_2(|s|)})$ for input $s$.

$P = NP\text{ if and only if } \exists p \in NP-\text{ complete such that } p \in P$

Trending Questions

Popular # Hahtags

Popular Questions