User Mohammad Al-Turkistany

8

votes

2

answers

432

views

Partition of a set of integers into subsets with prescribed sums

cc.complexity-theory

Mar 9 '15 at 16:00 Community♦ 1

22

votes

5

answers

861

views

Curious about computer-assisted NP-completeness proofs

Jun 1 '16 at 13:23 Community♦ 1

3

votes

1

answer

56

views

Emptiness of complement of subspace arrangement

co.combinatorics computational-geometry arrangements finite-fields

Feb 9 '15 at 10:19 Gamow 5,457

16

votes

1

answer

550

views

Integer linear programming in logarithmic number of variables

cc.complexity-theory np open-problem

Jan 28 '15 at 20:38 Michael Lampis 3,044

16

votes

2

answers

2k

views

Is NP in $DTIME(n^{poly\log n})$?

cc.complexity-theory complexity-classes

Mar 21 '14 at 14:00 Andras Farago 10.4k

16

votes

1

answer

400

views

Strongly Regular Graph and GI-Completeness

cc.complexity-theory graph-theory graph-algorithms graph-isomorphism structural-complexity

Oct 7 '14 at 19:49 Joshua Grochow 33.7k

18

votes

4

answers

1k

views

Open problems related to Graph isomorphism

graph-isomorphism fixed-parameter-tractable

Oct 8 '14 at 14:34 Community♦ 1

18

votes

2

answers

1k

views

The motivation for using Karp-reductions in the theory of $\mathcal{NP}$-completeness

cc.complexity-theory np-hardness soft-question

Nov 19 '12 at 20:01 Kaveh 21k

12

votes

4

answers

3k

views

List of strongly NP-hard problems with numerical data

np-hardness big-list hamiltonian-paths

Jan 27 '15 at 2:55 PageWizard 53

42

votes

22

answers

4k

views

What hierarchies and/or hierarchy theorems do you know?

cc.complexity-theory reference-request big-list survey hierarchy-theorems

Dec 16 '19 at 7:02 Hermann Gruber 5,019

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

5

votes

1

answer

3k

views

Some good Theoretical Computer Science Journals

soft-question research-practice paper-review journals

Dec 29 '14 at 4:23 Lei Deng 51

8

votes

3

answers

278

views

How many sets of vectors can be represented as the solutions of a Horn-SAT instance?

cc.complexity-theory co.combinatorics sat

Mar 16 '15 at 6:30 Community♦ 1

8

votes

1

answer

218

views

A curious asymmetry in good characterizations

cc.complexity-theory graph-theory co.combinatorics

Nov 10 '14 at 18:08 Community♦ 1

17

votes

2

answers

762

views

Set Cover for Permutation Matrices

ds.algorithms approximation-algorithms set-cover permutations

Nov 15 '10 at 5:12 Tsuyoshi Ito 16.1k

21

votes

1

answer

902

views

Algorithms and structural complexity theory

cc.complexity-theory structural-complexity

Nov 1 '12 at 9:05 sdcvvc 1,241

21

votes

6

answers

2k

views

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

cc.complexity-theory complexity-classes p-vs-np

Dec 2 '16 at 13:11 Community♦ 1

63

votes

5

answers

5k

views

The origin of the notion of treewidth

graph-theory co.combinatorics big-picture ho.history-overview treewidth

Jan 10 '19 at 9:44 Glorfindel 205

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

34

votes

17

answers

2k

views

Hardness jumps in computational complexity?

cc.complexity-theory

Jan 3 '19 at 18:34 Community♦ 1

10

votes

2

answers

641

views

Approximating non-trivial graph automorphism?

cc.complexity-theory graph-theory automorphism symmetry

Apr 22 '11 at 13:21 Mohammad Al-Turkistany 20.1k

2

votes

2

answers

331

views

Separation of limited nondeterminism classes?

cc.complexity-theory nondeterminism

Sep 29 '10 at 7:49 Community♦ 1

4

votes

1

answer

303

views

Density of distinct satisfying assignments for uniquely satisfiable formulas

cc.complexity-theory

Mar 23 '12 at 13:34 Sajin Koroth 536

6

votes

1

answer

321

views

Best lower bound for proof complexity of graph non-automorphism problem

cc.complexity-theory graph-isomorphism proof-complexity automorphism

Jan 23 '12 at 19:43 Glauber De Bona 11

9

votes

2

answers

714

views

Constructing uniquely satisfiable formulas

cc.complexity-theory unique-solution

Nov 25 at 15:09 Timothy Chow 6,883

5

votes

2

answers

956

views

Is there an efficient algorithm to determine the parity of the longest path in a graph?

cc.complexity-theory ds.algorithms graph-theory

Sep 15 '11 at 14:30 Community♦ 1

5

votes

0

answers

329

views

Complexity of balanced graph partition problem

cc.complexity-theory open-problem

Sep 1 '11 at 12:51 Jukka Suomela 11.1k

4

votes

2

answers

510

views

NP-complete variants of NPI problems

cc.complexity-theory np-hardness

Jul 1 '12 at 23:25 Community♦ 1

5

votes

4

answers

871

views

Hard problems on subclasses of planar cubic bipartite graphs

cc.complexity-theory reference-request graph-classes

Nov 5 '11 at 18:18 didest 1,541

26

votes

5

answers

2k

views

Subexponentially solvable hard graph problems

cc.complexity-theory reference-request

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

457 Bookmarks

Partition of a set of integers into subsets with prescribed sums

Curious about computer-assisted NP-completeness proofs

Emptiness of complement of subspace arrangement

Integer linear programming in logarithmic number of variables

Is NP in $DTIME(n^{poly\log n})$?

Strongly Regular Graph and GI-Completeness

Open problems related to Graph isomorphism

The motivation for using Karp-reductions in the theory of $\mathcal{NP}$-completeness

List of strongly NP-hard problems with numerical data

What hierarchies and/or hierarchy theorems do you know?

Explain P = NP problem to 10 year old

Some good Theoretical Computer Science Journals

How many sets of vectors can be represented as the solutions of a Horn-SAT instance?

A curious asymmetry in good characterizations

Set Cover for Permutation Matrices

Algorithms and structural complexity theory

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

The origin of the notion of treewidth

Natural NP-complete problems with “large” witnesses

Hardness jumps in computational complexity?

Approximating non-trivial graph automorphism?

Separation of limited nondeterminism classes?

Density of distinct satisfying assignments for uniquely satisfiable formulas

Best lower bound for proof complexity of graph non-automorphism problem

Constructing uniquely satisfiable formulas

Is there an efficient algorithm to determine the parity of the longest path in a graph?

Complexity of balanced graph partition problem

NP-complete variants of NPI problems

Hard problems on subclasses of planar cubic bipartite graphs

Subexponentially solvable hard graph problems