Explore Our Questions

active hot week month

more tags

0

votes

0

answers

28

views

Subset Sum Problem and hard looking instances that are not really hard

co.combinatorics np-hardness np-complete subset-sum

asked 22 hours ago Jesus Salas 124

1

vote

0

answers

39

views

how to achieve a topological sort of an given sequence with minimum swaps

np-hardness sorting

asked Nov 29 at 15:28 user51340 6

125

votes

28

answers

17k

views

Problems Between P and NPC

cc.complexity-theory np-hardness big-list np-intermediate

modified Nov 27 at 12:17 Gamow 3,824

2

votes

1

answer

85

views

What is the best approximation and exact algorithm for vertex cover on cubic graphs?

cc.complexity-theory ds.algorithms np-hardness complexity-classes approximation-algorithms

answered Nov 22 at 20:32 Mohemnist 93

26

votes

1

answer

1k

views

Functions that are Not Efficiently Computable but Learnable

cc.complexity-theory np-hardness machine-learning turing-machines lg.learning

modified Nov 17 at 22:23 Aryeh 5,379

2

votes

1

answer

127

views

A least sized partition of a set under a distance metric

np-hardness computational-geometry

modified Nov 14 at 20:08 Mohsen Ghorbani 50

9

votes

1

answer

125

views

Best known asymptotic PCP sizes / 3-SAT

cc.complexity-theory reference-request np-hardness pcp

modified Oct 31 at 9:02 Or Meir 3,945

1

vote

1

answer

73

views

A dominate vector subset sum problem

np-hardness np-complete dynamic-programming subset-sum

modified Oct 29 at 18:47 Paul 68

8

votes

0

answers

109

views

Complexity of fractional SAT

cc.complexity-theory np-hardness complexity-classes sat

asked Oct 14 at 1:21 Dmytro Taranovsky 1,422

2

votes

0

answers

82

views

Counting the maximum number of paths of length $n$ that differ in at least $k$ edges

graph-algorithms np-hardness approximation-algorithms

modified Oct 4 at 1:44 user3508551 167

0

votes

0

answers

33

views

How should a reduction to the Cardinality Constrained Quadratic Knapsack Problem work?

cc.complexity-theory np-hardness reductions

modified Oct 2 at 1:57 Arthur M 4

10

votes

2

answers

673

views

Set optimization problem - is it np-complete?

np-hardness optimization

modified Sep 30 at 22:01 Community♦ 1

3

votes

0

answers

43

views

Hardness of ancilla free quantum circuit extraction from circuit with ancillas

np-hardness quantum-computing quantum-information reversible-computing

asked Sep 25 at 10:33 John 116

1

vote

0

answers

55

views

Reasoning about NP hardness of optimization problems with closed form functions as input

cc.complexity-theory np-hardness approximation-hardness

modified Sep 10 at 16:30 karmanaut 388

Browse More Questions

Theoretical Computer Science Stack Exchange works best with JavaScript enabled