User Mohammad Al-Turkistany

314

votes

29

answers

195k

views

Core algorithms deployed

Nov 25 '13 at 22:41 Community♦ 1

466

votes

70

answers

167k

views

What papers should everyone read?

big-list soft-question

Feb 15 at 16:45 gadmm 55

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

364

votes

92

answers

110k

views

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list

Jan 5 '19 at 10:30 Community♦ 1

250

votes

11

answers

96k

views

What is the enlightenment I'm supposed to attain after studying finite automata?

fl.formal-languages automata-theory big-picture teaching dfa

Jan 14 '16 at 11:00 Aryeh 8,240

223

votes

60

answers

90k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 at 13:30 Community♦ 1

145

votes

39

answers

41k

views

What videos should everybody watch?

soft-question big-list

Apr 5 at 1:36 Raphael Augusto 433

59

votes

4

answers

26k

views

Why is 2SAT in P?

cc.complexity-theory np-hardness big-picture polynomial-time

Jun 9 '11 at 8:06 Dave 591

79

votes

2

answers

25k

views

What is the actual time complexity of Gaussian elimination?

cc.complexity-theory ds.algorithms reference-request linear-algebra

Jun 16 at 13:40 auspicious99 111

56

votes

9

answers

23k

views

Explain P = NP problem to 10 year old

cc.complexity-theory soft-question teaching p-vs-np

Jan 16 '14 at 8:24 Community♦ 1

39

votes

9

answers

21k

views

What is the difference between non-determinism and randomness?

automata-theory randomness computability

Oct 6 '15 at 9:00 Nikos M. 563

130

votes

28

answers

20k

views

Problems Between P and NPC

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

Nov 27 '18 at 12:17 Community♦ 1

27

votes

7

answers

17k

views

Why is CNF used for SAT and not DNF?

ds.algorithms sat

Jun 18 '15 at 14:01 Lenar Hoyt 294

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

101

votes

37

answers

14k

views

What are the recent TCS books whose drafts are available online?

reference-request big-list books

Dec 25 '18 at 5:55 kauray 125

72

votes

9

answers

13k

views

Powerful Algorithms too complex to implement

ds.algorithms ds.data-structures big-list implementation

Jul 24 '18 at 17:51 Kevin A. Wortman 383

63

votes

14

answers

13k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 19

120

votes

13

answers

12k

views

Advice on good research practices

soft-question research-practice advice-request

Jul 13 '18 at 4:29 Community♦ 1

124

votes

11

answers

10k

views

How hard is unshuffling a string?

ds.algorithms open-problem

Feb 25 '19 at 10:45 Mohammad Al-Turkistany 19.8k

45

votes

4

answers

10k

views

Is finding the minimum regular expression an NP-complete problem?

np-hardness fl.formal-languages lg.learning regular-expressions

Nov 10 at 19:31 Hermann Gruber 4,799

30

votes

7

answers

9k

views

Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?

cc.complexity-theory soft-question big-picture p-vs-np physics

Dec 23 '13 at 3:31 Community♦ 1

59

votes

6

answers

9k

views

How to get a job

soft-question career advice-request

Apr 4 '12 at 19:24 Community♦ 1

79

votes

9

answers

9k

views

Are research papers hard to read?

soft-question research-practice

May 16 at 10:03 a3nm 6,776

22

votes

2

answers

8k

views

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

computability turing-machines context-free

Apr 24 at 9:22 Yonatan N 1,435

114

votes

17

answers

8k

views

Examples of the price of abstraction?

ds.algorithms reference-request big-list lower-bounds

Jun 22 '16 at 23:15 Community♦ 1

107

votes

7

answers

8k

views

Solid applications of category theory in TCS?

pl.programming-languages lo.logic ct.category-theory

May 8 '19 at 9:06 Community♦ 1

61

votes

13

answers

8k

views

Open problems on the frontiers of TCS

big-list open-problem

Jun 4 at 2:45 Community♦ 1

47

votes

20

answers

7k

views

NP-hard problems on trees

cc.complexity-theory np-hardness tree

Jul 14 '19 at 21:52 Mohammad Al-Turkistany 19.8k

63

votes

11

answers

7k

views

Common false beliefs in theoretical computer science

big-list examples

May 17 '13 at 13:10 Community♦ 1

38

votes

7

answers

5k

views

Many-one reductions vs. Turing reductions to define NPC

cc.complexity-theory np-hardness reductions

Oct 10 '14 at 16:02 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

456 Bookmarks

Core algorithms deployed

What papers should everyone read?

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

Algorithms from the Book.

What is the enlightenment I'm supposed to attain after studying finite automata?

Major unsolved problems in theoretical computer science?

What videos should everybody watch?

Why is 2SAT in P?

What is the actual time complexity of Gaussian elimination?

Explain P = NP problem to 10 year old

What is the difference between non-determinism and randomness?

Problems Between P and NPC

Why is CNF used for SAT and not DNF?

What Lecture Notes Should Everyone Read?

What are the recent TCS books whose drafts are available online?

Powerful Algorithms too complex to implement

Applications of topology to computer science

Advice on good research practices

How hard is unshuffling a string?

Is finding the minimum regular expression an NP-complete problem?

Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?

How to get a job

Are research papers hard to read?

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

Examples of the price of abstraction?

Solid applications of category theory in TCS?

Open problems on the frontiers of TCS

NP-hard problems on trees

Common false beliefs in theoretical computer science

Many-one reductions vs. Turing reductions to define NPC