User Realz Slaw

581

votes

6

answers

118k

views

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

Jul 16 at 22:57 dmbarbour 81

466

votes

70

answers

167k

views

What papers should everyone read?

big-list soft-question

Feb 15 at 16:45 gadmm 55

250

votes

11

answers

96k

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

223

votes

60

answers

90k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 at 13:30 Community♦ 1

130

votes

28

answers

20k

views

Problems Between P and NPC

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

Nov 27 '18 at 12:17 Community♦ 1

95

votes

15

answers

10k

views

A simple decision problem whose decidability is not known

computability decidability

Nov 7 at 22:23 Bjørn Kjos-Hanssen♦ 4,273

79

votes

2

answers

25k

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

72

votes

9

answers

13k

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

66

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

62

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

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

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

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

45

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

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

41

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

37

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

35

votes

5

answers

2k

views

Integer multiplication when one integer is fixed

cc.complexity-theory ds.algorithms circuit-complexity algebraic-complexity arithmetic-circuits

Jul 14 '16 at 7:46 T.... 11k

31

votes

5

answers

4k

views

Fast Reduction from RSA to SAT

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

2d ago GManNickG 103

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.4k

26

votes

3

answers

2k

views

Cryptography without assumptions — seeking an overview

cr.crypto-security

Dec 6 '13 at 12:58 Stefano Tessaro 41

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

23

votes

2

answers

1k

views

To what extent can an algorithm predict the time complexity an arbitrary input program?

computability time-complexity formal-methods se.software-engineering

May 3 '15 at 16:36 Andrej Bauer 24k

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

22

votes

2

answers

849

views

Multiplicative version of 3-SUM

cc.complexity-theory ds.algorithms time-complexity

Nov 4 '10 at 8:02 Raphael 2,009

21

votes

2

answers

1k

views

Are AND&OR circuits P-complete?

cc.complexity-theory circuit-complexity

Sep 4 '12 at 14:57 vzn 10.6k

21

votes

1

answer

759

views

How close can we get to linear multiply, add, and compare (on integers)?

ds.algorithms ds.data-structures worst-case

Nov 16 '12 at 9:02 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.4k

20

votes

5

answers

26k

views

Direct SAT to 3-SAT reduction

cc.complexity-theory sat reductions

Jun 12 at 15:03 Jared 111

20

votes

2

answers

784

views

maintaining a balanced spanning tree of a growing undirected graph

graph-theory ds.data-structures graph-algorithms tree online-algorithms

Dec 29 '11 at 0:47 SuperElectric 331

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

72 Bookmarks

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

What papers should everyone read?

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

Major unsolved problems in theoretical computer science?

Problems Between P and NPC

A simple decision problem whose decidability is not known

What is the actual time complexity of Gaussian elimination?

Powerful Algorithms too complex to implement

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

Polynomial-time algorithms with huge exponent/constant

Evidence that matrix multiplication can be done in quadratic time?

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

What are the outstanding questions in purely functional data structures?

If you could rename dynamic programming…

Approximation algorithms for Metric TSP

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

Sum-of-square-roots-hard problems?

Integer multiplication when one integer is fixed

Fast Reduction from RSA to SAT

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

Cryptography without assumptions — seeking an overview

Implications of proof of abc conjecture for cs theory

To what extent can an algorithm predict the time complexity an arbitrary input program?

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

Multiplicative version of 3-SUM

Are AND&OR circuits P-complete?

How close can we get to linear multiply, add, and compare (on integers)?

Is there a proof that addition is faster than multiplication?

Direct SAT to 3-SAT reduction

maintaining a balanced spanning tree of a growing undirected graph