User Mohammad Al-Turkistany

6

votes

2

answers

245

views

find the most similar topological ordering of a dag

np-hardness

Aug 1 at 22:11 Vinicius dos Santos 1,673

3

votes

1

answer

72

views

Interval partitioning with restrictions: NP-complete or efficiently solvable?

Apr 22 at 18:59 lacker 246

11

votes

3

answers

2k

views

“Almost all objects have property P” vs. “It is easy to test whether an object has property P”

cc.complexity-theory pr.probability

Jan 28 at 18:24 xrq 1,025

9

votes

1

answer

171

views

What is the complexity of checking equivalence of two boolean formulae without NOT symbol?

cc.complexity-theory lo.logic sat boolean-functions

Dec 13 at 16:06 Emil Jeřábek 11.7k

12

votes

0

answers

138

views

NP-Hardness of 4-cycle packing problem in complete bipartite digraph?

graph-theory np-hardness

Dec 10 at 12:47 Mengfan Ma 365

8

votes

1

answer

216

views

A partition problem with order constraints

np-hardness partition-problem

Jul 25 '19 at 7:35 Erel Segal-Halevi 1,540

10

votes

1

answer

231

views

P and Descriptive Complexity

lo.logic polynomial-time descriptive-complexity

Feb 12 '19 at 7:28 Hermann Gruber 4,849

6

votes

2

answers

490

views

Is this partition problem strongly NP-complete?

cc.complexity-theory partition-problem

Jun 8 '19 at 21:44 daniello 2,696

4

votes

1

answer

99

views

Complexity of finding Exact Size Cut-Sets in Bipartite Graphs

cc.complexity-theory graph-theory np-complete polynomial-time max-cut

Oct 24 '18 at 8:41 allrtaken 71

7

votes

2

answers

399

views

NP-Complete Static Square Puzzles

np-complete puzzles

Nov 13 '18 at 15:50 carlesm 19

10

votes

1

answer

309

views

Is algorithmic information theory still evolving?

cc.complexity-theory it.information-theory

Oct 14 '18 at 19:54 Bjørn Kjos-Hanssen♦ 4,273

12

votes

0

answers

448

views

Is satisfying $\sum_{i=1}^{n}{x_i^{y_i}}=r$ NP Complete?

np-complete np subset-sum sum-of-squares

Jul 26 '18 at 14:52 Bjørn Kjos-Hanssen♦ 4,273

15

votes

1

answer

722

views

Barriers to show $P=NP$

p-vs-np barriers

Jun 21 '18 at 21:55 Peter Shor 22.7k

6

votes

1

answer

114

views

NP completeness of classes of spanning trees

cc.complexity-theory np-hardness np

May 25 '18 at 8:54 Gamow 5,402

19

votes

4

answers

864

views

Problems that are counter-intuitively solvable in practice?

cc.complexity-theory ds.algorithms np-hardness

May 29 '18 at 11:10 riemann77 141

3

votes

1

answer

115

views

Isomorphism Problems with Unknown Single-Exponential Algorithms

graph-isomorphism

May 6 '18 at 3:26 Joshua Grochow 32.9k

3

votes

1

answer

129

views

On complexity of linear programming with quadratic equality/inequality constraints?

cc.complexity-theory ds.algorithms linear-programming polynomial-time convex-optimization

Apr 25 '18 at 9:25 Gamow 5,402

11

votes

2

answers

311

views

Maximum matching M with the condition G[M] is 2K_2-free

matching

Nov 30 at 9:59 Cyriac Antony 788

12

votes

1

answer

564

views

Complexity of testing if two sets of $m$ points in $\mathbb{R}^n$ differ only by rotation?

cc.complexity-theory complexity-classes graph-isomorphism computational-geometry high-dimensional-geometry

Feb 24 '18 at 12:27 Jarek Duda 317

5

votes

1

answer

341

views

Is it possible to infer on the thermodynamics of two problems if a reduction from $B$ to $A$ exists?

cc.complexity-theory physics statistical-physics random-graphs

Jul 4 at 22:29 Glorfindel 197

8

votes

2

answers

977

views

Isn't it “trivial” to represent/reduce any classical physics problem into a Spin-Glass which is NP-Complete?

complexity-classes reductions np-complete physics statistical-physics

Jul 3 at 18:28 0x90 421

13

votes

1

answer

1k

views

Entropy and computational complexity

cc.complexity-theory reference-request it.information-theory quantum-information statistical-physics

Feb 2 '18 at 10:15 Community♦ 1

17

votes

2

answers

503

views

Is it possible to encrypt a CNF?

cc.complexity-theory cr.crypto-security one-way-function cryptojacking

Feb 10 '18 at 19:26 Mohammad Al-Turkistany 19.8k

20

votes

2

answers

1k

views

Can any computational challenge be transformed to proof-of-work?

cc.complexity-theory cr.crypto-security cryptojacking

Mar 5 '18 at 5:40 Joseph Van Name 1

232

votes

11

answers

117k

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

10

votes

2

answers

298

views

Complexity of Homogenizing a String

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

Jul 3 '17 at 17:09 isaacg 658

9

votes

2

answers

280

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.3k

4

votes

1

answer

245

views

String version of even-odd partition problem

cc.complexity-theory np-hardness

Sep 3 '17 at 21:57 Andrew Ryzhikov 371

7

votes

2

answers

593

views

Is this vertex ordering optimization NP-Hard?

graph-theory np-hardness permutations

Jun 13 at 19:26 Mohammad Al-Turkistany 19.8k

14

votes

2

answers

550

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.5k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

455 Bookmarks

find the most similar topological ordering of a dag

Interval partitioning with restrictions: NP-complete or efficiently solvable?

“Almost all objects have property P” vs. “It is easy to test whether an object has property P”

What is the complexity of checking equivalence of two boolean formulae without NOT symbol?

NP-Hardness of 4-cycle packing problem in complete bipartite digraph?

A partition problem with order constraints

P and Descriptive Complexity

Is this partition problem strongly NP-complete?

Complexity of finding Exact Size Cut-Sets in Bipartite Graphs

NP-Complete Static Square Puzzles

Is algorithmic information theory still evolving?

Is satisfying $\sum_{i=1}^{n}{x_i^{y_i}}=r$ NP Complete?

Barriers to show $P=NP$

NP completeness of classes of spanning trees

Problems that are counter-intuitively solvable in practice?

Isomorphism Problems with Unknown Single-Exponential Algorithms

On complexity of linear programming with quadratic equality/inequality constraints?

Maximum matching M with the condition G[M] is 2K_2-free

Complexity of testing if two sets of $m$ points in $\mathbb{R}^n$ differ only by rotation?

Is it possible to infer on the thermodynamics of two problems if a reduction from $B$ to $A$ exists?

Isn't it “trivial” to represent/reduce any classical physics problem into a Spin-Glass which is NP-Complete?

Entropy and computational complexity

Is it possible to encrypt a CNF?

Can any computational challenge be transformed to proof-of-work?

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

Complexity of Homogenizing a String

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

String version of even-odd partition problem

Is this vertex ordering optimization NP-Hard?

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