Tag: np-hardness

Found 311 results for 'np-hardness'.

1) cc.complexity-theory - NP-hard problems on trees
2) graph-algorithms - Relationship between two graph optimization problems
3) graph-theory - Is there a problem that is easy for cubic graphs but hard for graphs with maximum degree 3?
4) np-hardness - Directed NP-hard problems on DAGs
5) cc.complexity-theory - Minimum weight subforest of given cardinality
6) cc.complexity-theory - NP-complete problems with optimal approximation in poly-time
7) cc.complexity-theory - Natural CLIQUE to k-Color reduction
8) cc.complexity-theory - Classes of graphs with easy Hamiltonian cycle but NP-hard TSP
9) cc.complexity-theory - Complexity of edge coloring in planar graphs
10) cc.complexity-theory - Minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?
11) graph-theory - On the paper "Quantum Computing Hamiltonian cycles"
12) ds.algorithms - What is the complexity of this weighted b-edge matching problem?
13) cc.complexity-theory - Lexicographically minimal topological sort of a labeled DAG
14) ds.algorithms - Bob's Sale (reordering of pairs with constraints to minimize sum of products)
15) cc.complexity-theory - Hard extendability problems
16) co.combinatorics - Subset Sum Problem and hard looking instances that are not really hard
17) cc.complexity-theory - Ranking the Difficulty of NP Hard Problems in Practice
18) cc.complexity-theory - Hardness of approximation - additive error
19) cc.complexity-theory - Non-rooted MST of directed graph
20) cc.complexity-theory - NP completeness of classes of spanning trees
21) cc.complexity-theory - Is there a natural problem on the naturals that is NP-complete?
22) reference-request - Graph classes in which CLIQUE is known to be NP-hard?
23) graph-algorithms - Exact Algorithms for r-Dominating Set on Bounded Treewidth Graphs
24) cc.complexity-theory - Graph problems which are NP-Complete on directed graphs but polynomial on undirected graphs
25) cc.complexity-theory - H-free cut problem
26) cc.complexity-theory - Complexity of finding an edge set yielding specified vertex degrees
27) cc.complexity-theory - Is "Is a permutation p an automorphism of a graph in my set?" NP-complete?
28) cc.complexity-theory - How hard is deciding the existence of Red-Blue perfect matching?
29) cc.complexity-theory - NP-complete variants of NPI problems
30) cc.complexity-theory - Problems that are counter-intuitively solvable in practice?
31) cc.complexity-theory - Natural candidates for the hierarchy inside NPI
32) reference-request - Status of certain problems in knot theory
33) cc.complexity-theory - Reducing P vs. NP to SAT
34) cc.complexity-theory - Ladner's Theorem vs. Schaefer's Theorem
35) reference-request - Is it still open to determine the complexity of computing the treewidth of planar graphs?
36) np-hardness - $k$-clique in $k$-partite graph
37) graph-theory - Finding vertex separator such that the induced subgraph has minimal number of edges
38) cc.complexity-theory - For which k is PLANAR NAE k-SAT in P?
39) cc.complexity-theory - Edge-partitioning cubic graphs into claws and paths
40) cc.complexity-theory - Why is the reduction from 3-SAT to 3-dimensional Matching Parsimonious?
41) cc.complexity-theory - What is known about the H-factor problem?
42) cc.complexity-theory - If only pathological cases of NP-hard problems are difficult to solve, then why isn't NP-hard defined to only include those pathological cases?
43) cc.complexity-theory - NP-Complete Hard-on-Average Problems
44) cc.complexity-theory - Sparsification Lemma for k-SAT and Exponential Time Hypothesis
45) cc.complexity-theory - Efficient algorithm for existence of permutation with differences sequence?
46) cc.complexity-theory - Is pooling-aware bin packing NP-Hard?
47) cc.complexity-theory - NP-hardness of a special case of Number Partitioning
48) np-hardness - Complexity class of a subset problem similar to subset sum
49) cc.complexity-theory - Subset sum vs. Subset product (strong vs. weak NP hardness)
50) np-hardness - A partition problem in which some numbers may be cut