#

algorithamic-complexity

Here is 1 public repository matching this topic...

minakshihub / P-VS-NP-SUBSET-SUM

An unverified, structured attempt at a Polynomial -Time Solution to the NP-complete Subset Sum Problem.

python research np-complete discrete-mathematics mathematical-logic polynomial-time subset-sum complexity-theory computational-theory p-vs-np algorithamic-complexity structured-algorithams

Updated Jul 8, 2025
TeX

Improve this page

Add a description, image, and links to the algorithamic-complexity topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithamic-complexity topic, visit your repo's landing page and select "manage topics."