User Realz Slaw

471

votes

70

answers

169k

views

What papers should everyone read?

big-list soft-question

Feb 15 '20 at 16:45 gadmm 55

583

votes

6

answers

119k

views

What's new in purely functional data structures since Okasaki?

reference-request big-list ds.data-structures functional-programming

Jul 16 at 22:57 dmbarbour 81

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

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

20

votes

5

answers

27k

views

Direct SAT to 3-SAT reduction

cc.complexity-theory sat reductions

Jun 12 at 15:03 Jared 111

82

votes

2

answers

26k

views

What is the actual time complexity of Gaussian elimination?

cc.complexity-theory ds.algorithms reference-request linear-algebra

Jun 16 at 13:40 auspicious99 111

134

votes

29

answers

21k

views

Problems Between P and NPC

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

Aug 15 at 23:45 Mark S 802

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

45

votes

4

answers

13k

views

Approximation algorithms for Metric TSP

cc.complexity-theory graph-algorithms approximation-algorithms tsp exp-time-algorithms

Jan 25 '19 at 3:01 Community♦ 1

98

votes

15

answers

10k

views

A simple decision problem whose decidability is not known

computability decidability

Nov 7 '19 at 22:23 Bjørn Kjos-Hanssen♦ 4,308

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

7

votes

3

answers

7k

views

Split or merge Binary Search Trees in O(log n)

ds.data-structures tree

Oct 31 '13 at 22:14 Dai Le 3,614

14

votes

1

answer

6k

views

The computational complexity of matrix multiplication

cc.complexity-theory time-complexity linear-algebra matrix-product

Jul 2 '12 at 7:59 Kaveh 21k

52

votes

2

answers

6k

views

What are the outstanding questions in purely functional data structures?

big-list ds.data-structures functional-programming

Jun 11 '12 at 14:48 Community♦ 1

33

votes

5

answers

5k

views

Fast Reduction from RSA to SAT

cc.complexity-theory cr.crypto-security sat reductions factoring

Aug 4 at 16:14 GManNickG 103

38

votes

2

answers

4k

views

Sum-of-square-roots-hard problems?

ds.algorithms big-list reductions computing-over-reals

Jan 6 '11 at 5:07 Community♦ 1

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

6

votes

1

answer

4k

views

Guidelines to reduce general TSP to Triangle TSP

cc.complexity-theory np-hardness np tsp hamiltonian-paths

Oct 23 '12 at 18:24 Kristoffer Arnsfelt Hansen 3,915

47

votes

11

answers

4k

views

If you could rename dynamic programming…

ds.algorithms soft-question terminology ho.history-overview

Feb 7 '14 at 3:07 Joshua Grochow 33.7k

13

votes

3

answers

4k

views

Is there an online-algorithm to keep track of components in a changing undirected graph?

ds.algorithms graph-theory approximation-algorithms online-algorithms

Apr 30 '13 at 3:39 Community♦ 1

59

votes

4

answers

3k

views

Evidence that matrix multiplication can be done in quadratic time?

ds.algorithms linear-algebra matrix-product

Jan 29 '17 at 8:24 Chad Brewbaker 2,315

13

votes

1

answer

3k

views

Matrix multiplication in $O(n^2 \log n)$

ds.algorithms linear-algebra matrix-product

Dec 16 '11 at 22:16 Saeed 3,383

8

votes

2

answers

3k

views

Monotone-2SAT and Vertex Cover

cc.complexity-theory ds.algorithms sat

Sep 20 '10 at 12:53 Community♦ 1

42

votes

3

answers

3k

views

Consequences of a quasi-polynomial time algorithm for the graph isomorphism problem

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

Jan 30 '17 at 12:42 Community♦ 1

16

votes

2

answers

2k

views

Hard Instances for graph isomorphism testing

ds.algorithms graph-isomorphism

Mar 5 '17 at 10:31 Mohamed Mimouni 1

24

votes

2

answers

2k

views

Implications of proof of abc conjecture for cs theory

big-picture nt.number-theory

Nov 17 '12 at 8:03 Community♦ 1

21

votes

1

answer

2k

views

Is there a proof that addition is faster than multiplication?

cc.complexity-theory time-complexity

Sep 22 '12 at 19:46 Jeffε 22.5k

14

votes

4

answers

2k

views

Subrange of a Red and Black Tree

ds.data-structures tree

Feb 3 '11 at 2:41 Danny Sleator 105

26

votes

3

answers

2k

views

Cryptography without assumptions — seeking an overview

cr.crypto-security

Dec 6 '13 at 12:58 Stefano Tessaro 41

22

votes

10

answers

2k

views

Problems that are easy on unweighted graphs, but hard for weighted graphs

cc.complexity-theory graph-algorithms np-hardness

Jan 26 '15 at 14:09 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

72 Bookmarks

What papers should everyone read?

What's new in purely functional data structures since Okasaki?

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

Major unsolved problems in theoretical computer science?

Direct SAT to 3-SAT reduction

What is the actual time complexity of Gaussian elimination?

Problems Between P and NPC

Powerful Algorithms too complex to implement

Approximation algorithms for Metric TSP

A simple decision problem whose decidability is not known

Polynomial-time algorithms with huge exponent/constant

Split or merge Binary Search Trees in O(log n)

The computational complexity of matrix multiplication

What are the outstanding questions in purely functional data structures?

Fast Reduction from RSA to SAT

Sum-of-square-roots-hard problems?

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

Guidelines to reduce general TSP to Triangle TSP

If you could rename dynamic programming…

Is there an online-algorithm to keep track of components in a changing undirected graph?

Evidence that matrix multiplication can be done in quadratic time?

Matrix multiplication in $O(n^2 \log n)$

Monotone-2SAT and Vertex Cover

Consequences of a quasi-polynomial time algorithm for the graph isomorphism problem

Hard Instances for graph isomorphism testing

Implications of proof of abc conjecture for cs theory

Is there a proof that addition is faster than multiplication?

Subrange of a Red and Black Tree

Cryptography without assumptions — seeking an overview

Problems that are easy on unweighted graphs, but hard for weighted graphs