User Mohammad Al-Turkistany

18

votes

1

answer

1k

views

Complexity of interval cover problem

cc.complexity-theory np-hardness

Jan 31 '15 at 16:20 Community♦ 1

14

votes

2

answers

552

views

Add a matching to a Hamiltonian path to reduce the max distance between given pairs of vertices

cc.complexity-theory graph-theory graph-algorithms np-hardness np-complete

Apr 7 '17 at 10:58 Marzio De Biasi 21.7k

24

votes

1

answer

844

views

What is the complexity of this covering problem?

cc.complexity-theory ds.algorithms reference-request

Aug 27 '12 at 9:53 Community♦ 1

4

votes

1

answer

985

views

Can two strings be matched as disjoint subsequences of a string?

cc.complexity-theory ds.algorithms string-matching

Oct 2 '14 at 12:29 Community♦ 1

5

votes

2

answers

555

views

Proof for ACYCLIC PARTITION being NP-complete

graph-theory approximation-algorithms np-complete

Mar 2 '14 at 8:18 Ricky 53

13

votes

1

answer

361

views

Another variant of PARTITION

cc.complexity-theory reference-request partition-problem subset-sum

Apr 29 '14 at 3:48 Yury 3,721

232

votes

11

answers

118k

views

Is Norbert Blum's 2017 proof that $P \ne NP$ correct?

cc.complexity-theory np-hardness complexity-classes

Sep 4 '18 at 16:56 Ixer 55

7

votes

1

answer

318

views

Problem of graph bi-partition (related to graph isomorphism)

graph-theory graph-algorithms graph-isomorphism np-complete

Apr 29 '16 at 15:57 Community♦ 1

10

votes

2

answers

302

views

Complexity of Homogenizing a String

cc.complexity-theory ds.algorithms reference-request string-matching edit-distance

Jul 3 '17 at 17:09 isaacg 712

9

votes

2

answers

282

views

Is there a computing problem which is in quasi-polynomial time but is (maybe) not in $\beta P$?

cc.complexity-theory complexity-classes

Jun 23 '17 at 23:57 Andras Farago 10.4k

17

votes

1

answer

777

views

Does the uncomputability of Kolmogorov complexity follow from Lawvere's Fixed Point Theorem?

lo.logic computability ct.category-theory kolmogorov-complexity

Mar 28 '17 at 1:04 Community♦ 1

12

votes

1

answer

197

views

Reductions between languages of different densities?

cc.complexity-theory reductions structural-complexity

Mar 20 '17 at 15:33 daniello 3,081

9

votes

2

answers

165

views

Complexity of Computing Lexicographically Minimal Element of Orbit

permutations gr.group-theory complexity

Mar 13 '17 at 18:20 Boson 550

15

votes

3

answers

969

views

Complexity of topological sort with constrained positions

sorting directed-acyclic-graph partial-order order-theory topological-sorting

May 15 at 15:49 a3nm 6,946

7

votes

0

answers

221

views

How hard is PromiseFlowFree?

cc.complexity-theory np-hardness puzzles

Feb 14 '17 at 10:45 Community♦ 1

15

votes

2

answers

429

views

(How) Could we discover/analyze NP problems in the absence of the Turing model of computation?

soft-question lambda-calculus turing-machines functional-programming np

Dec 7 '16 at 12:37 Damiano Mazza 4,308

25

votes

2

answers

1k

views

Is there an NP-complete language that contains precisely half of the n-bit instances?

cc.complexity-theory np np-complete

Nov 29 '16 at 4:42 Kaveh 21k

8

votes

1

answer

927

views

Efficiently finding the minimum number of transpositions needed to sort a list

ds.algorithms sorting permutations edit-distance

Oct 16 '12 at 12:05 Community♦ 1

28

votes

2

answers

646

views

Bounded-input bijections of infinite sequences

puzzles ct.category-theory topology

Nov 16 '10 at 21:45 Andrej Bauer 24.8k

23

votes

2

answers

10k

views

How is proving a context free language to be ambiguous undecidable?

computability turing-machines context-free

Sep 14 at 18:20 rsonx 101

6

votes

1

answer

344

views

Average-case analysis of algorithms using the incompressibility method

cc.complexity-theory kolmogorov-complexity average-case-complexity

Jun 26 '11 at 14:54 Pat Morin 116

9

votes

3

answers

317

views

Is there a generalization of information theory to polynomially knowable information?

cc.complexity-theory it.information-theory polynomial-time

Jun 27 '14 at 19:38 Ari Trachtenberg 242

43

votes

12

answers

4k

views

Applications of representation theory of the symmetric group

co.combinatorics permutations fourier-analysis gr.group-theory

Mar 22 '14 at 20:57 Community♦ 1

7

votes

0

answers

272

views

Is this graph polynomial known? Can it be efficiently computed?

cc.complexity-theory graph-theory co.combinatorics symmetry

Mar 21 '16 at 11:18 Community♦ 1

7

votes

1

answer

470

views

Quasi-polynomial time algorithm for permutation group isomorphism

cc.complexity-theory graph-isomorphism gr.group-theory

Feb 11 '16 at 8:32 Community♦ 1

7

votes

0

answers

445

views

Is there a program for theory of incompleteness in $NP$?

cc.complexity-theory

Jun 4 '15 at 14:42 Community♦ 1

13

votes

4

answers

999

views

Finding the sparsest solution to a system of linear equations

np-hardness linear-algebra linear-programming matrices sparse-matrix

Dec 17 '15 at 16:50 argentpepper 2,241

5

votes

6

answers

306

views

Data representation affecting problem complexity

cc.complexity-theory

Dec 8 '15 at 20:57 Mohammad Al-Turkistany 20.1k

7

votes

1

answer

175

views

What's the complexity of recognizing equivalence for the following relation?

cc.complexity-theory time-complexity equivalence

Nov 1 '14 at 3:09 Tsuyoshi Ito 16.1k

11

votes

3

answers

669

views

History and status of the graph matching problem

reference-request graph-theory graph-isomorphism

Jun 5 '13 at 19:19 Chandra Chekuri 6,106

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

457 Bookmarks

Complexity of interval cover problem

Add a matching to a Hamiltonian path to reduce the max distance between given pairs of vertices

What is the complexity of this covering problem?

Can two strings be matched as disjoint subsequences of a string?

Proof for ACYCLIC PARTITION being NP-complete

Another variant of PARTITION

Is Norbert Blum's 2017 proof that $P \ne NP$ correct?

Problem of graph bi-partition (related to graph isomorphism)

Complexity of Homogenizing a String

Is there a computing problem which is in quasi-polynomial time but is (maybe) not in $\beta P$?

Does the uncomputability of Kolmogorov complexity follow from Lawvere's Fixed Point Theorem?

Reductions between languages of different densities?

Complexity of Computing Lexicographically Minimal Element of Orbit

Complexity of topological sort with constrained positions

How hard is PromiseFlowFree?

(How) Could we discover/analyze NP problems in the absence of the Turing model of computation?

Is there an NP-complete language that contains precisely half of the n-bit instances?

Efficiently finding the minimum number of transpositions needed to sort a list

Bounded-input bijections of infinite sequences

How is proving a context free language to be ambiguous undecidable?

Average-case analysis of algorithms using the incompressibility method

Is there a generalization of information theory to polynomially knowable information?

Applications of representation theory of the symmetric group

Is this graph polynomial known? Can it be efficiently computed?

Quasi-polynomial time algorithm for permutation group isomorphism

Is there a program for theory of incompleteness in $NP$?

Finding the sparsest solution to a system of linear equations

Data representation affecting problem complexity

What's the complexity of recognizing equivalence for the following relation?

History and status of the graph matching problem