User Mohammad Al-Turkistany

27

votes

5

answers

2k

views

Ecology and evolution through the algorithmic lens

Jun 25 '14 at 2:40 Community♦ 1

27

votes

3

answers

1k

views

Succinct Problems in $\mathsf{P}$

cc.complexity-theory reference-request complexity-classes

Nov 5 '13 at 20:05 Community♦ 1

27

votes

1

answer

641

views

Is there a problem that is easy for cubic graphs but hard for graphs with maximum degree 3?

graph-theory graph-algorithms np-hardness

Apr 15 at 8:25 Glorfindel 205

27

votes

7

answers

19k

views

Why is CNF used for SAT and not DNF?

ds.algorithms sat

Jun 18 '15 at 14:01 Lenar Hoyt 304

27

votes

6

answers

2k

views

How do you get a “Physical Intuition” for results in TCS?

soft-question intuition

Mar 31 '12 at 3:25 stevegt 111

27

votes

2

answers

1k

views

Is it possible to find if a sequence exists in polynomial time in the following problem?

ds.algorithms np-hardness sorting

Feb 10 '11 at 9:00 Marzio De Biasi 21.7k

27

votes

2

answers

764

views

Papers to credit for spectral partitioning of graphs

ds.algorithms graph-theory ho.history-overview expanders spectral-graph-theory

Nov 22 '10 at 18:19 V Vinay 3,783

26

votes

3

answers

967

views

Computing any information about Max-3SAT

cc.complexity-theory sat

Feb 6 '11 at 20:55 Andy Drucker 4,564

26

votes

3

answers

2k

views

Is it NP-hard to play international draughts correctly?

cc.complexity-theory np-hardness open-problem board-games

Apr 30 '13 at 3:34 Community♦ 1

26

votes

3

answers

1k

views

Decide whether a matrix's kernel contains any non-zero vector all of whose entries are -1, 0, or 1

cc.complexity-theory np-hardness linear-algebra

Dec 26 '13 at 14:07 Community♦ 1

26

votes

0

answers

667

views

Is Hankelability NP-hard?

cc.complexity-theory

Apr 21 '15 at 10:09 Community♦ 1

25

votes

1

answer

757

views

Recognizing sequences with all permutations of $\{1, \ldots, n\}$ as subsequences

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

Jun 18 '15 at 9:43 Community♦ 1

25

votes

5

answers

2k

views

Subexponentially solvable hard graph problems

cc.complexity-theory reference-request

Oct 17 '13 at 12:13 Saeed 3,393

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

25

votes

3

answers

1k

views

What are the relationships between those hypotheses in Fine-Grained Complexity Theory?

cc.complexity-theory reference-request complexity-classes fine-grained

Nov 5 '15 at 19:10 Community♦ 1

25

votes

4

answers

2k

views

When does (or should) Theoretical CS care about intuitionistic proofs?

lo.logic soft-question pl.programming-languages constructive-mathematics

May 23 '13 at 0:43 Community♦ 1

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

25

votes

1

answer

689

views

What is $\mathsf{NP}$ restricted to linear size witnesses?

cc.complexity-theory complexity-classes np

May 9 '12 at 20:50 Community♦ 1

25

votes

5

answers

2k

views

Verifying unique solutions of SAT

cc.complexity-theory np-hardness sat unique-solution

Jan 27 '14 at 14:44 Miki Hermann 21

25

votes

4

answers

4k

views

Arguments for existence of one-way functions

cc.complexity-theory cr.crypto-security big-picture one-way-function

May 18 '14 at 6:25 Community♦ 1

25

votes

4

answers

2k

views

Separating Logspace from Polynomial time

cc.complexity-theory lower-bounds space-bounded

May 30 '14 at 7:47 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

25

votes

4

answers

2k

views

Why do equalities between complexity classes translate upwards and not downwards?

cc.complexity-theory complexity-classes padding

Dec 4 '10 at 15:34 Community♦ 1

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

24

votes

3

answers

2k

views

Hardness of approximation - additive error

cc.complexity-theory complexity-classes np-hardness approximation-hardness

Nov 24 '10 at 14:31 Tsuyoshi Ito 16.1k

24

votes

2

answers

859

views

Space efficient “industrial” unbalanced expanders

graph-theory derandomization expanders

Dec 12 '17 at 9:31 Thomas Klimpel 2,963

24

votes

6

answers

2k

views

Graph families which have polynomial time algorithms for computing the chromatic number

ds.algorithms graph-theory co.combinatorics

Aug 31 '10 at 21:30 Joel Rybicki 493

24

votes

3

answers

1k

views

NP complete graph problems about structural properties

cc.complexity-theory reference-request graph-theory np-complete survey

Jan 1 at 14:31 TeamBright 337

24

votes

1

answer

845

views

What is the complexity of this covering problem?

cc.complexity-theory ds.algorithms reference-request

Aug 27 '12 at 9:53 Community♦ 1

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

457 Bookmarks

Ecology and evolution through the algorithmic lens

Succinct Problems in $\mathsf{P}$

Is there a problem that is easy for cubic graphs but hard for graphs with maximum degree 3?

Why is CNF used for SAT and not DNF?

How do you get a “Physical Intuition” for results in TCS?

Is it possible to find if a sequence exists in polynomial time in the following problem?

Papers to credit for spectral partitioning of graphs

Computing any information about Max-3SAT

Is it NP-hard to play international draughts correctly?

Decide whether a matrix's kernel contains any non-zero vector all of whose entries are -1, 0, or 1

Is Hankelability NP-hard?

Recognizing sequences with all permutations of $\{1, \ldots, n\}$ as subsequences

Subexponentially solvable hard graph problems

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

What are the relationships between those hypotheses in Fine-Grained Complexity Theory?

When does (or should) Theoretical CS care about intuitionistic proofs?

Mathematical implications of complexity theory conjectures outside TCS

What is $\mathsf{NP}$ restricted to linear size witnesses?

Verifying unique solutions of SAT

Arguments for existence of one-way functions

Separating Logspace from Polynomial time

Proofs, Barriers and P vs NP

Why do equalities between complexity classes translate upwards and not downwards?

An edge partitioning problem on cubic graphs

Hardness of approximation - additive error

Space efficient “industrial” unbalanced expanders

Graph families which have polynomial time algorithms for computing the chromatic number

NP complete graph problems about structural properties

What is the complexity of this covering problem?

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