Category:Weakly NP-complete problems

From Vero - Wikipedia

Jump to navigation Jump to search

There is currently no text in this page. You can search for this page title in other pages, or search the related logs, but you do not have permission to create this page.

Template:AnchorPages in category "Weakly NP-complete problems"

The following 2 pages are in this category, out of 2 total.

K

Knapsack problem

S

Subset sum problem

Retrieved from "https://wiki.sarg.dev/index.php/Category:Weakly_NP-complete_problems"