vegafrank

6 ms·

1. 1.▲
   A New Breakthrough Algorithm Solves the Unsolvable: A Giant Leap Towards P = NP(pypi.org)

   2 points by vegafrank 2y ago|1 comments
2. 2.▲
   Strong evidence that P = NP(researchgate.net)

   3 points by vegafrank 2y ago|2 comments
3. 3.▲
   The Minimum Vertex Cover Problem(researchgate.net)

   1 points by vegafrank 2y ago|1 comments
4. 4.▲
   Capablanca: Minimum Vertex Cover Solver(pypi.org)

   18 points by vegafrank 2y ago|3 comments
5. 5.▲
   SAT in Polynomial Time: A Proof of P = NP(preprints.org)

   3 points by vegafrank 2y ago|5 comments
6. 6.▲
   by vegafrank 2y ago

   The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows propo
7. 7.▲
   Aegypti: Faster Triangle Finding and More(pypi.org)

   7 points by vegafrank 2y ago|3 comments