User Mohammad Al-Turkistany

15

votes

1

answer

1k

views

Is the following problem NP hard?

May 21 '17 at 9:04 Neal Young 6,528

54

votes

2

answers

3k

views

Can one amplify P=NP beyond P=PH?

cc.complexity-theory reference-request complexity-classes conditional-results polynomial-hierarchy

May 18 '17 at 12:42 András Salamon 18.4k

13

votes

1

answer

272

views

Hard extendability problems

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

Apr 12 '17 at 18:30 Mohammad Al-Turkistany 20.1k

46

votes

3

answers

4k

views

An NP-complete variant of factoring.

cc.complexity-theory np-hardness factoring

Apr 8 '17 at 18:39 Mohammad Al-Turkistany 20.1k

25

votes

1

answer

1k

views

An edge partitioning problem on cubic graphs

graph-theory np-hardness co.combinatorics

Apr 7 '17 at 12:08 Mohammad Al-Turkistany 20.1k

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

3

votes

0

answers

110

views

Intractability of restricted decomposition of connected bridgeless cubic graphs

cc.complexity-theory graph-theory

Apr 3 '17 at 21:23 Community♦ 1

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

7

votes

2

answers

381

views

possible bridge between group growth theory and complexity theory?

cc.complexity-theory reference-request complexity-classes big-picture gr.group-theory

Mar 14 '17 at 5:41 Community♦ 1

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

25

votes

5

answers

2k

views

Mathematical implications of complexity theory conjectures outside TCS

cc.complexity-theory conditional-results

Feb 26 '17 at 6:49 Community♦ 1

7

votes

0

answers

221

views

How hard is PromiseFlowFree?

cc.complexity-theory np-hardness puzzles

Feb 14 '17 at 10:45 Community♦ 1

32

votes

5

answers

2k

views

Evidence that PPAD is hard?

cc.complexity-theory complexity-classes gt.game-theory conditional-results

Feb 7 '17 at 19:07 Daniel Apon 5,835

42

votes

3

answers

3k

views

Consequences of a quasi-polynomial time algorithm for the graph isomorphism problem

cc.complexity-theory ds.algorithms graph-theory graph-isomorphism

Jan 30 '17 at 12:42 Community♦ 1

115

votes

15

answers

17k

views

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

Jan 23 '17 at 4:51 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

21

votes

6

answers

2k

views

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

cc.complexity-theory complexity-classes p-vs-np

Dec 2 '16 at 13:11 Community♦ 1

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

5

votes

1

answer

275

views

Average-case complexity open problems other than one-way functions

cc.complexity-theory reference-request average-case-complexity

Nov 14 '16 at 15:49 Sasho Nikolov 17.8k

21

votes

2

answers

992

views

$NP$-completeness of recognizing the difference of two permutations

cc.complexity-theory co.combinatorics np-hardness permutations

Sep 8 '16 at 7:46 Community♦ 1

15

votes

3

answers

2k

views

Complexity of edge coloring in planar graphs

cc.complexity-theory graph-theory np-hardness graph-colouring

Jul 20 '16 at 20:29 draks ... 155

5

votes

0

answers

85

views

Computational depth and p-time hard instances

cc.complexity-theory reference-request kolmogorov-complexity average-case-complexity hard-instances

Jul 15 '16 at 17:10 Kaveh 21k

27

votes

2

answers

725

views

Deciding whether an NC${}^0_3$ circuit computes a permutation or not

cc.complexity-theory open-problem permutations circuit-families

Jul 12 '16 at 5:46 Community♦ 1

25

votes

4

answers

2k

views

Proofs, Barriers and P vs NP

cc.complexity-theory proofs barriers p-vs-np

Jun 23 '16 at 10:08 Kaveh 21k

29

votes

2

answers

2k

views

Can you identify the sum of two permutations in polynomial time?

cc.complexity-theory ds.algorithms co.combinatorics np-hardness permutations

Jun 3 '16 at 15:12 Community♦ 1

22

votes

5

answers

861

views

Curious about computer-assisted NP-completeness proofs

cc.complexity-theory reference-request soft-question reductions proof-assistants

Jun 1 '16 at 13:23 Community♦ 1

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

8

votes

3

answers

814

views

Choosing random permutations in “strict” polynomial time

ds.algorithms permutations polynomial-time

Mar 23 '16 at 5:44 Joe Fitzsimons 13.3k

33

votes

5

answers

2k

views

Programming languages for efficient computation

cc.complexity-theory computability pl.programming-languages

Mar 22 '16 at 16:18 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

457 Bookmarks

Is the following problem NP hard?

Can one amplify P=NP beyond P=PH?

Hard extendability problems

An NP-complete variant of factoring.

An edge partitioning problem on cubic graphs

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

Intractability of restricted decomposition of connected bridgeless cubic graphs

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

Reductions between languages of different densities?

possible bridge between group growth theory and complexity theory?

Complexity of Computing Lexicographically Minimal Element of Orbit

Mathematical implications of complexity theory conjectures outside TCS

How hard is PromiseFlowFree?

Evidence that PPAD is hard?

Consequences of a quasi-polynomial time algorithm for the graph isomorphism problem

What Lecture Notes Should Everyone Read?

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

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

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

Average-case complexity open problems other than one-way functions

$NP$-completeness of recognizing the difference of two permutations

Complexity of edge coloring in planar graphs

Computational depth and p-time hard instances

Deciding whether an NC${}^0_3$ circuit computes a permutation or not

Proofs, Barriers and P vs NP

Can you identify the sum of two permutations in polynomial time?

Curious about computer-assisted NP-completeness proofs

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

Choosing random permutations in “strict” polynomial time

Programming languages for efficient computation