Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in np-complete

Can NP-Intermediate exist if P = NP?

Comparing syntax trees modulo alpha conversion

can some sorting be P, NP, and NP-Complete?

Counting Subgraph Instances

Reduce Subset Sum to Polyomino Packing

Is this combinatorial optimization problem NP-hard?

If a problem X (decision problem) is known to be NP-Complete, and proven to be reduced to problem Y, can you then say problem Y is NP-Complete?

NP-Completeness in Task Scheduling

Efficient scheduling jobs with declining profits on multiple machines

Algorithm for scheduling jobs on processors

Subset Inference NP-complete?

algorithm np-complete

minimal multiplications vs a set-cover issue

Verification algorithm for minimum vertex cover?

Dividing a list of numbers into roughtly equal totals

NP-Complete vs. NP-hard [closed]

Is SUDOKU np-complete? [closed]

sudoku np-complete

Optimal algorithm to count the number of strings a DFA accepts

Why is TSP NP-hard while the Hamiltonian path NP-complete?

Need Algorithm to group files of varying sizes into approximately equal blocks

Are all NP problems also NP-complete?