Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in np-complete

Complexity measurement of NP-complete

complexity-theory np-complete np np-hard set-cover

Is the 0-1 Knapsack that each item has the same weight NP-complete?

algorithm np-complete np

Heuristic to find the maximum weight independent set in an arbritary graph

algorithm graph graph-algorithm linear-programming np-complete

Looking for a model to represent this problem, which I suspect may be NP-complete

algorithm computer-science theory np-complete

What is a good algorithm for compacting records in a blocked file?

algorithm language-agnostic np-complete defragmentation knapsack-problem

How to delete consecutive elements in a linked list which add up to 0

python algorithm linked-list subset-sum np-complete

P and NP complete problems [duplicate]

computer-science theory complexity-theory np-complete p-np

Proving NP-Completeness of a problem

algorithm np-complete reduction

NP complete - solvable in non-deterministic polynomial time

algorithm time-complexity np-complete

Reduction algorithm from the Hamiltonian cycle

algorithm graph graph-theory np-complete hamiltonian-cycle

Which of these languages is NP-complete?

algorithm computer-science theory np-complete np

Splitting a Domain name into constituent words (if possible)?

nlp algorithm dynamic-programming np-complete

Where to find a set of hard Traveling Salesman Problems (with known solutions/approximations)?

algorithm language-agnostic np-complete traveling-salesman np-hard

If A is NP-complete and if there is a reduction from A to B, does it imply that B is also NP-complete? [closed]

complexity-theory reduction np-complete np-hard

3-cnf-sat with a twist question

computer-science np-complete conjunctive-normal-form

algorithm to check whether a given graph is subgraph of another graph [closed]

graph np-complete subgraph isomorphism

Is generating all strings permutation NP Complete?

traveling-salesman np np-complete

Constrained Knapsack without weight

algorithm combinatorics knapsack-problem approximation np-complete

Why all NP-complete problems can be reducible to 3-SAT? [closed]

np np-complete sat
Older Entries »