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

New posts in np-hard

Selecting k sub-posets

algorithm graph complexity-theory np-hard poset

What is the minimum number of swaps needed so that the difference of sums of arrays a and b is minimum?

arrays algorithm np-hard

NP-Complete vs. NP-hard [closed]

algorithm complexity-theory np-complete np-hard

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

algorithm graph-theory np-complete np-hard

List of problems that are in general NP-hard but have polynomial-time solution in planar graphs?

algorithm graph np-complete np-hard planar-graph

Minimum cost strongly connected digraph

algorithm graph traveling-salesman np-hard

How to find what numbers in a set add up to another given number?

c# algorithm np-complete np-hard

max-weight k-clique in a complete k-partite graph

algorithm complexity-theory np-hard clique-problem

NP-Complete VS NP-Hard

algorithm computer-science np-complete np np-hard

largest possible rectangle of letters

algorithm optimization np-hard

Relationship between NP-hard and undecidable problems

algorithm np-hard decidable

I need high performance. Will there be a difference if I use C or C++?

c++ c performance np-hard

Minimum number of flips to get adjacent 1's in a matrix

algorithm graph-algorithm combinatorics np-hard

Teacher time schedule algorithm

algorithm scheduling np-hard

3 dimensional bin packing algorithms

algorithm language-agnostic mathematical-optimization np-hard bin-packing

What is the problem name for Traveling salesman problem(TSP) without considering going back to starting point?

algorithm graph-algorithm traveling-salesman np-hard

Parabolic knapsack

algorithm np-hard

What are the differences between NP, NP-Complete and NP-Hard?

computer-science complexity-theory np np-complete np-hard