User Giorgio Camerani

8

votes

1

answer

299

views

On $\text{ETH}$ with $m$ as parameter: consequences of algorithm running in time $2^{\delta m}$ where $\delta \to 0$ as $k \to \infty$

Dec 1 at 12:10 Giorgio Camerani 6,469

1

vote

0

answers

136

views

Consequences of the existence of the following algorithm: does it imply any complexity class separation / collapse?

cc.complexity-theory ds.algorithms complexity-classes lower-bounds

Jan 19 '15 at 20:36 Giorgio Camerani 6,469

4

votes

1

answer

282

views

How hard is to compute $\Delta_{|V|}$?

cc.complexity-theory complexity-classes counting-complexity graph-isomorphism

Jan 15 '13 at 18:09 Community♦ 1

12

votes

1

answer

904

views

Consequences of $\oplus \mathbf{P} \subseteq \mathbf{NP}$

cc.complexity-theory graph-theory complexity-classes sat counting-complexity

Dec 25 '19 at 16:41 Tayfun Pay 2,549

30

votes

4

answers

3k

views

Consequences of NP=PSPACE

cc.complexity-theory complexity-classes conditional-results

Feb 14 '14 at 20:20 Alex Grilo 534

33

votes

5

answers

4k

views

The unreasonable power of non-uniformity

cc.complexity-theory complexity-classes big-picture

May 2 '14 at 12:07 Thomas Klimpel 2,943

67

votes

7

answers

4k

views

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

cc.complexity-theory np-hardness big-picture

Mar 9 '14 at 21:27 Sylvain 3,264

38

votes

4

answers

1k

views

Examples where the uniqueness of the solution makes it easier to find

cc.complexity-theory ds.algorithms graph-algorithms complexity-classes unique-solution

Jun 20 '18 at 16:38 Mohammad Al-Turkistany 20.2k

36

votes

3

answers

915

views

Why does randomness have stronger effect on reductions than on algorithms?

cc.complexity-theory reductions derandomization

Jan 14 '14 at 10:12 Niel de Beaudrap 8,679

3

votes

1

answer

160

views

Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges

graph-theory co.combinatorics

Feb 19 '16 at 7:45 Community♦ 1

34

votes

17

answers

2k

views

Hardness jumps in computational complexity?

cc.complexity-theory

Jan 3 '19 at 18:34 Community♦ 1

9

votes

2

answers

630

views

Restricted Monotone 3CNF formula: counting satisfying assignments (both modulo $2^n$ and modulo $2$)

cc.complexity-theory sat counting-complexity

Aug 30 '13 at 17:54 Community♦ 1

31

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

33

votes

2

answers

2k

views

When does “X is NP-complete” imply “#X is #P-complete”?

cc.complexity-theory np-hardness counting-complexity

May 24 '17 at 18:17 Tayfun Pay 2,549

27

votes

2

answers

1k

views

Ladner's Theorem vs. Schaefer's Theorem

cc.complexity-theory np-hardness complexity-classes sat csp

Jan 9 '13 at 14:13 András Salamon 18.4k

28

votes

2

answers

845

views

Tight Lower bounds on Savitch's theorem

cc.complexity-theory space-bounded

Dec 23 '12 at 10:24 Pratik Deoghare 1,914

17

votes

1

answer

2k

views

What are the #P-complete subfamilies of #2-SAT?

cc.complexity-theory sat counting-complexity

Nov 29 '12 at 16:05 Niel de Beaudrap 8,679

3

votes

1

answer

2k

views

Maximum clique algorithm on undirected graph

ds.algorithms graph-algorithms clique examples

Jan 7 '12 at 16:48 Hsien-Chih Chang 張顯之 7,438

35

votes

9

answers

2k

views

Surprising Results in Complexity (Not on the Complexity Blog List)

cc.complexity-theory big-list

Oct 6 '10 at 14:17 Giorgio Camerani 6,469

65

votes

17

answers

8k

views

Polynomial-time algorithms with huge exponent/constant

ds.algorithms big-list

Jan 22 '18 at 0:44 Thomas Klimpel 2,943

9

votes

2

answers

522

views

The ODD EVEN DELTA problem

ds.algorithms graph-theory graph-algorithms counting-complexity

Jan 10 '13 at 15:37 Community♦ 1

14

votes

2

answers

416

views

A question to the #P-complete proof of the permanent from Ben-Dor/Halevi

cc.complexity-theory counting-complexity permanent

Feb 16 '12 at 23:04 Tyson Williams 4,228

17

votes

5

answers

3k

views

Real world applications of quantum computing (except for security)

quantum-computing application-of-theory

Dec 8 '12 at 0:30 Robin Kothari 13.1k

224

votes

60

answers

91k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 '20 at 13:30 Community♦ 1

62

votes

4

answers

28k

views

Why is 2SAT in P?

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

Jun 9 '11 at 8:06 Dave 591

23

votes

3

answers

4k

views

Minimum Unsatisfiable 3-CNF Formulae

cc.complexity-theory sat

Jan 24 '20 at 2:59 ian.p.swift 41

26

votes

5

answers

2k

views

Long-lasting errors in computer science

soft-question big-list

Aug 21 '11 at 8:26 Jukka Suomela 11.1k

72

votes

9

answers

14k

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

369

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

61

votes

8

answers

3k

views

What is the complexity class most closely associated with what the human mind can accomplish quickly?

cc.complexity-theory complexity-classes soft-question

Jan 13 '18 at 23:31 Oliphaunt - reinstate Monica 111

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

32 Bookmarks

On $\text{ETH}$ with $m$ as parameter: consequences of algorithm running in time $2^{\delta m}$ where $\delta \to 0$ as $k \to \infty$

Consequences of the existence of the following algorithm: does it imply any complexity class separation / collapse?

How hard is to compute $\Delta_{|V|}$?

Consequences of $\oplus \mathbf{P} \subseteq \mathbf{NP}$

Consequences of NP=PSPACE

The unreasonable power of non-uniformity

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

Examples where the uniqueness of the solution makes it easier to find

Why does randomness have stronger effect on reductions than on algorithms?

Bits required to encode difference between number of subgraphs with odd number of edges and number of subgraphs with even number of edges

Hardness jumps in computational complexity?

Restricted Monotone 3CNF formula: counting satisfying assignments (both modulo $2^n$ and modulo $2$)

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

When does “X is NP-complete” imply “#X is #P-complete”?

Ladner's Theorem vs. Schaefer's Theorem

Tight Lower bounds on Savitch's theorem

What are the #P-complete subfamilies of #2-SAT?

Maximum clique algorithm on undirected graph

Surprising Results in Complexity (Not on the Complexity Blog List)

Polynomial-time algorithms with huge exponent/constant

The ODD EVEN DELTA problem

A question to the #P-complete proof of the permanent from Ben-Dor/Halevi

Real world applications of quantum computing (except for security)

Major unsolved problems in theoretical computer science?

Why is 2SAT in P?

Minimum Unsatisfiable 3-CNF Formulae

Long-lasting errors in computer science

Powerful Algorithms too complex to implement

Algorithms from the Book.

What is the complexity class most closely associated with what the human mind can accomplish quickly?