Profile Activity

Mohammad Al-Turkistany

Meta user

Network profile

Reputation

13,948

14k
12.3k
10.7k

2016
2017
2018
2019

Top tag

cc.complexity-theory

Next privilege

15,000 Rep.

Protect questions

Badges

132

Newest

Necromancer

Next badge

91/100

Impact

37 posts edited

24 helpful flags

4,090 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

440 Favorites

Added Views Newest Activity Votes

307

votes

answers

192k

views

Core algorithms deployed

Nov 25 '13 at 22:41 Community♦ 1

454

votes

answers

161k

views

What papers should everyone read?

big-list soft-question

Sep 20 at 15:13 VS. 213

232

votes

answers

116k

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 35

358

votes

answers

109k

views

Algorithms from the Book.

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

Jan 5 at 10:30 xrq 693

247

votes

answers

95k

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 6,252

218

votes

answers

86k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Sep 23 at 6:55 VS. 213

140

votes

answers

39k

views

What videos should everybody watch?

soft-question big-list

Jan 29 '17 at 0:00 Richard Cox 19

votes

answers

22k

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

votes

answers

22k

views

Why is 2SAT in P?

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

Jun 9 '11 at 8:06 Dave 591

votes

answers

21k

views

What is the actual time complexity of Gaussian elimination?

ds.algorithms reference-request linear-algebra

Jan 18 '15 at 18:38 Community♦ 1

votes

answers

19k

views

What is the difference between non-determinism and randomness?

automata-theory randomness computability

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

128

votes

answers

19k

views

Problems Between P and NPC

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

Nov 27 at 12:17 Gamow 4,487

113

votes

answers

16k

views

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

Jan 23 '17 at 4:51 Community♦ 1

votes

answers

15k

views

Why is CNF used for SAT and not DNF?

ds.algorithms sat

Jun 18 '15 at 14:01 Lenar Hoyt 199

votes

answers

13k

views

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

reference-request big-list books

Dec 25 at 5:55 kauray 125

votes

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 178

votes

answers

11k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 19

118

votes

answers

11k

views

Advice on good research practices

soft-question research-practice advice-request

Jul 13 '18 at 4:29 Community♦ 1

117

votes

answers

10k

views

How hard is unshuffling a string?

ds.algorithms open-problem

Feb 25 at 10:45 Mohammad Al-Turkistany 13.9k

votes

answers

views

How to get a job

soft-question career advice-request

Apr 4 '12 at 19:24 Community♦ 1

votes

answers

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

votes

answers

views

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

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

Feb 1 '18 at 18:01 mbomb007 103

votes

answers

views

Are research papers hard to read?

soft-question research-practice

Oct 12 '14 at 4:54 Alessandro Cosentino 2,980

112

votes

answers

views

Examples of the price of abstraction?

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

Jun 22 '16 at 23:15 Community♦ 1

103

votes

answers

views

Solid applications of category theory in TCS?

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

May 8 at 9:06 michid 131

votes

answers

views

Open problems on the frontiers of TCS

big-list open-problem

Jun 21 '15 at 20:11 Community♦ 1

votes

answer

views

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

computability turing-machines context-free

May 25 '14 at 15:00 Martin Berger 9,490

votes

answers

views

Common false beliefs in theoretical computer science

big-list examples

May 17 '13 at 13:10 Community♦ 1

votes

answers

views

NP-hard problems on trees

cc.complexity-theory np-hardness tree

Jul 14 at 21:52 Mohammad Al-Turkistany 13.9k

votes

answers

views

Hard-looking algorithmic problems made easy by theorems

cc.complexity-theory ds.algorithms graph-algorithms

Nov 12 '15 at 9:20 Emil Jeřábek 10.8k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

440 Favorites

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?

Explain P = NP problem to 10 year old

Why is 2SAT in P?

What is the actual time complexity of Gaussian elimination?

What is the difference between non-determinism and randomness?

Problems Between P and NPC

What Lecture Notes Should Everyone Read?

Why is CNF used for SAT and not DNF?

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?

How to get a job

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

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

Are research papers hard to read?

Examples of the price of abstraction?

Solid applications of category theory in TCS?

Open problems on the frontiers of TCS

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

Common false beliefs in theoretical computer science

NP-hard problems on trees

Hard-looking algorithmic problems made easy by theorems