So I really know very little about the subject but from the little I could gather online...(adsbygoogle = window.adsbygoogle || []).push({});

Consider the subset problem on wikipedia. Does a subset of {−2, −3, 15, 14, 7, −10} equal zero? It shows the work for you and then says that no algorithm to find it in polynomial time is known, only in exponential (with (2^n)-1 tries) It says that an algorithm can only exist in polynomial time if P=NP. So now, can we not set (2^n)-1=n^x so that the algorithm in polynomial time is n^((log((2^n)-1)+2i∏c)/(log(n)) where c∈Z, Z being the set of integers. Does that make any sense?

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# P does equal NP?

Loading...

Similar Threads for does equal | Date |
---|---|

Why does entering '0' terminate do-while loop here? | Feb 2, 2018 |

Testing floating point numbers for equality | Jan 12, 2018 |

Why does this MIPS program do what it does? | Nov 17, 2017 |

Python What does this Python program do? | Nov 17, 2017 |

Fortran How does Fortran Execute this Statement? | Mar 15, 2017 |

**Physics Forums - The Fusion of Science and Community**