User Mohammad Al-Turkistany

7

votes

0

answers

272

views

Is this graph polynomial known? Can it be efficiently computed?

Mar 21 '16 at 11:18 Community♦ 1

7

votes

1

answer

470

views

Quasi-polynomial time algorithm for permutation group isomorphism

cc.complexity-theory graph-isomorphism gr.group-theory

Feb 11 '16 at 8:32 Community♦ 1

15

votes

4

answers

678

views

Program reasoning about own source code

pl.programming-languages ai.artificial-intel recursion

Jan 17 '16 at 14:38 Community♦ 1

251

votes

11

answers

97k

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,789

17

votes

2

answers

598

views

Complexity of the coset intersection problem

cc.complexity-theory graph-isomorphism gr.group-theory

Dec 24 '15 at 9:58 Community♦ 1

53

votes

1

answer

2k

views

Is there a gap amplification type of result for the Graph Isomorphism Problem?

cc.complexity-theory graph-isomorphism pcp

Dec 24 '15 at 7:50 Joe Bebel 2,265

13

votes

4

answers

999

views

Finding the sparsest solution to a system of linear equations

np-hardness linear-algebra linear-programming matrices sparse-matrix

Dec 17 '15 at 16:50 argentpepper 2,241

38

votes

9

answers

3k

views

Optimal greedy algorithms for NP-hard problems

cc.complexity-theory lower-bounds approximation-algorithms greedy-algorithms approximation-hardness

Dec 17 '15 at 16:11 Community♦ 1

5

votes

6

answers

306

views

Data representation affecting problem complexity

cc.complexity-theory

Dec 8 '15 at 20:57 Mohammad Al-Turkistany 20.1k

54

votes

7

answers

4k

views

For which problems in P is it easier to verify the result than to find it?

cc.complexity-theory ds.algorithms reference-request

Nov 20 '15 at 18:08 Yonatan N 1,525

63

votes

14

answers

14k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 119

36

votes

3

answers

3k

views

Consequences of Factoring being in P?

cc.complexity-theory cr.crypto-security conditional-results factoring

Nov 12 '15 at 12:36 Community♦ 1

29

votes

16

answers

5k

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 12.6k

8

votes

1

answer

263

views

Does the isomorphism conjecture imply exponential lower bounds on witnesses density?

cc.complexity-theory structural-complexity

Nov 7 '15 at 23:32 Ryan Williams 25.3k

7

votes

0

answers

2k

views

Reduction from Vertex Cover to Max-Cut? [closed]

np-hardness max-cut

Nov 5 '15 at 22:01 taninamdar 227

24

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

18

votes

2

answers

592

views

Proof that circuit upper bounds for $E$ imply $P \neq NP$

cc.complexity-theory circuit-complexity

Oct 17 '15 at 3:46 Community♦ 1

39

votes

9

answers

22k

views

What is the difference between non-determinism and randomness?

automata-theory randomness computability

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

28

votes

6

answers

1k

views

Natural NP-complete problems with “large” witnesses

cc.complexity-theory np proof-complexity

Oct 5 '15 at 1:39 Community♦ 1

18

votes

2

answers

2k

views

Linear diophantine equation in non-negative integers

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

Sep 30 '15 at 11:54 Community♦ 1

12

votes

2

answers

378

views

$\overline{SAT} \in NTIME(subexp)$?

sat exp-time-algorithms nexp

Sep 12 '15 at 21:37 Huck Bennett 4,402

32

votes

4

answers

849

views

Hardness of approximation assuming NP != coNP

approximation-hardness conditional-results

Sep 9 '15 at 23:29 Abhinav 103

4

votes

1

answer

107

views

NP-Complete Convergent Reductions?

reductions np-complete

Sep 8 '15 at 18:30 Joshua Grochow 33.7k

2

votes

1

answer

288

views

Universal witness set for $NP$

cc.complexity-theory reference-request

Sep 7 '15 at 15:55 Community♦ 1

20

votes

3

answers

2k

views

Who introduced nondeterministic computation?

reference-request soft-question ho.history-overview nondeterminism

Sep 2 '15 at 11:31 Mark Hurd 105

32

votes

3

answers

937

views

An Anthology of Complexity Assumptions

cc.complexity-theory complexity-classes big-list complexity-assumptions

Sep 1 '15 at 18:22 Community♦ 1

8

votes

1

answer

426

views

A question on GCT

cc.complexity-theory

Aug 30 '15 at 23:58 Joshua Grochow 33.7k

15

votes

1

answer

756

views

Permutations with forbidden subsequences

reference-request co.combinatorics permutations

Aug 20 '15 at 1:05 David Eppstein 49.2k

7

votes

0

answers

203

views

Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs

cc.complexity-theory proof-complexity

Aug 9 '15 at 22:21 Community♦ 1

21

votes

0

answers

638

views

What is the power of general poly-size permutation branching programs?

cc.complexity-theory complexity-classes circuit-complexity logspace structural-complexity

Jul 28 '15 at 13:39 Kristoffer Arnsfelt Hansen 3,915

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

457 Bookmarks

Is this graph polynomial known? Can it be efficiently computed?

Quasi-polynomial time algorithm for permutation group isomorphism

Program reasoning about own source code

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

Complexity of the coset intersection problem

Is there a gap amplification type of result for the Graph Isomorphism Problem?

Finding the sparsest solution to a system of linear equations

Optimal greedy algorithms for NP-hard problems

Data representation affecting problem complexity

For which problems in P is it easier to verify the result than to find it?

Applications of topology to computer science

Consequences of Factoring being in P?

Hard-looking algorithmic problems made easy by theorems

Does the isomorphism conjecture imply exponential lower bounds on witnesses density?

Reduction from Vertex Cover to Max-Cut? [closed]

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

Proof that circuit upper bounds for $E$ imply $P \neq NP$

What is the difference between non-determinism and randomness?

Natural NP-complete problems with “large” witnesses

Linear diophantine equation in non-negative integers

$\overline{SAT} \in NTIME(subexp)$?

Hardness of approximation assuming NP != coNP

NP-Complete Convergent Reductions?

Universal witness set for $NP$

Who introduced nondeterministic computation?

An Anthology of Complexity Assumptions

A question on GCT

Permutations with forbidden subsequences

Implications of the impossibility of efficient sampling from random non-Hamiltonian graphs

What is the power of general poly-size permutation branching programs?