List questions from np-complete

Published on 26 Jan 2017 - 18:42

592

Views

Diophantine equation and NP-Completness

Published on 04 Feb 2017 - 20:45

599

Views

Is Minimum Coverage Problem NP-hard?

Published on 09 Feb 2017 - 12:21

168

Views

If in the 3 CNF formula I were to replace the ANDs with ORs and ORs with ANDs would the problem still be NP complete?

Published on 26 Mar 2026 - 2:46

1.3k

Views

Can a problem be undecidable but yet Turing recognizable?

Published on 23 Feb 2026 - 10:14

80

Views

Proving NP-hardness of graph optimization problem

Published on 24 Feb 2017 - 21:18

104

Views

Computational and decision Problems: definition and NP-completeness

Published on 01 Mar 2017 - 20:45

81

Views

NP-completeness and changing it for a decision problem

Published on 03 Mar 2017 - 17:45

734

Views

If a graph G is the union of $n$ cliques of size $n$ no two of which share more than one vertex, then $\chi_f(G)=n$. $\omega(G)=n$

Published on 04 Mar 2017 - 14:13

223

Views

NPC: Reduction of VC to 2VC

Published on 07 Mar 2017 - 14:43

991

Views

3-SAT to Hamiltonian cycle reduction

Published on 15 Mar 2017 - 14:01

349

Views

P $\neq$ NP via Time Hierarchy Theorem?

Published on 26 Mar 2017 - 8:44

275

Views

Polynomial Time Decision Problems and P $\neq$ NP

Published on 30 Mar 2017 - 15:09

368

Views

Simple (?) NP-hard reduction

Published on 08 Apr 2017 - 21:56

33

Views

All graphs that are subgraphs of a fixed Graph $G$ is in $P$ or in NPC?

Published on 29 Jan 2023 - 15:21

List Question

Solving Checkers and EXPTIME?

Diophantine equation and NP-Completness

Is Minimum Coverage Problem NP-hard?

If in the 3 CNF formula I were to replace the ANDs with ORs and ORs with ANDs would the problem still be NP complete?

Can a problem be undecidable but yet Turing recognizable?

Proving NP-hardness of graph optimization problem

Computational and decision Problems: definition and NP-completeness

NP-completeness and changing it for a decision problem

If a graph G is the union of $n$ cliques of size $n$ no two of which share more than one vertex, then $\chi_f(G)=n$. $\omega(G)=n$

NPC: Reduction of VC to 2VC

3-SAT to Hamiltonian cycle reduction

P $\neq$ NP via Time Hierarchy Theorem?

Polynomial Time Decision Problems and P $\neq$ NP

Simple (?) NP-hard reduction

All graphs that are subgraphs of a fixed Graph $G$ is in $P$ or in NPC?

Trending Questions

Popular # Hahtags

Popular Questions