User Neal Young

120

votes

18

answers

9k

views

Examples of the price of abstraction?

Jul 27 at 13:59 Oliphaunt - reinstate Monica 111

101

votes

37

answers

14k

views

What are the recent TCS books whose drafts are available online?

reference-request big-list books

Dec 25 '18 at 5:55 kauray 125

64

votes

5

answers

2k

views

Problems that can be used to show polynomial-time hardness results

cc.complexity-theory lower-bounds conditional-results

Feb 10 '20 at 9:53 Michael Wehar 4,840

45

votes

0

answers

1k

views

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

cc.complexity-theory sat planar-graphs succinct

Dec 14 at 22:29 monty 1

40

votes

10

answers

13k

views

Data for testing graph algorithms

ds.algorithms graph-theory ds.data-structures data-sets

Jan 1 at 14:44 maxdan94 513

38

votes

9

answers

4k

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

31

votes

0

answers

5k

views

Combinatorics of Bellman-Ford or how to make cyclic graphs acyclic?

graph-theory lower-bounds directed-acyclic-graph dynamic-programming shortest-path

Jul 4 '18 at 12:35 Neal Young 6,972

28

votes

0

answers

698

views

The complexity of checking whether two DAG have the same number of topological sorts

cc.complexity-theory complexity-classes counting-complexity open-problem partial-order

1d ago SamiD 2,257

26

votes

0

answers

560

views

Rank mod 6 vs rank over the reals

linear-algebra matrices boolean-matrix

Jun 9 '17 at 14:07 Shachar Lovett 746

26

votes

0

answers

674

views

Is Hankelability NP-hard?

cc.complexity-theory

Apr 21 '15 at 10:09 Community♦ 1

19

votes

2

answers

1k

views

Can we decide whether a permanent has a unique term?

cc.complexity-theory ds.algorithms matrices matching permanent

Feb 14 '20 at 2:58 Neal Young 6,972

18

votes

1

answer

1k

views

Complexity of interval cover problem

cc.complexity-theory np-hardness

Jan 31 '15 at 16:20 Community♦ 1

16

votes

2

answers

534

views

Avalanche like stochastic process

pr.probability markov-chains stochastic-process

Nov 9 '10 at 8:36 Community♦ 1

16

votes

0

answers

363

views

Complexity of approximating the range of a matrix

cc.complexity-theory approximation-algorithms linear-algebra

Feb 2 '16 at 7:37 Community♦ 1

16

votes

0

answers

519

views

Sylver Coinage Game

co.combinatorics combinatorial-game-theory

Apr 14 '14 at 11:03 Community♦ 1

14

votes

1

answer

494

views

Comparing the Kolmogorov complexity of theories

lo.logic kolmogorov-complexity

Feb 10 '15 at 22:50 cody 12.7k

14

votes

1

answer

395

views

Probability that a random sorting network works

sorting-network

Mar 6 '18 at 18:19 Geoffrey Irving 3,064

14

votes

0

answers

427

views

Is it possible to find the median with a linear size sorting network?

ds.algorithms sorting sorting-network selection

Dec 9 '14 at 14:40 domotorp 13.2k

14

votes

3

answers

521

views

Is this optimum travelling problem under deadlines NP-hard on trees?

ds.algorithms graph-algorithms np-hardness

Jun 27 '14 at 18:11 vgta 31

14

votes

1

answer

591

views

Exact Algorithm for edge labeling problem in DAG

ds.algorithms reference-request co.combinatorics graph-algorithms directed-acyclic-graph

Feb 13 '12 at 12:49 Jeffε 22.6k

12

votes

0

answers

347

views

How good is greedy in average?

cc.complexity-theory co.combinatorics approximation-algorithms optimization greedy-algorithms

May 18 '15 at 16:11 Stasys 6,475

10

votes

2

answers

715

views

Set optimization problem - is it np-complete?

np-hardness optimization

Sep 30 '18 at 22:01 Community♦ 1

9

votes

0

answers

149

views

Optimal bee swarm plots: NP-hard?

np-hardness cg.comp-geom

Oct 30 '19 at 2:34 nathan34 56

9

votes

2

answers

331

views

Bounds on this Strategy for Separating Words

automata-theory dfa

Nov 13 at 18:05 acupoftea 166

8

votes

2

answers

265

views

Cheap online selection with weighted comparisons

cc.complexity-theory ds.algorithms reference-request online-algorithms

Aug 11 '12 at 6:09 Jeffε 22.6k

8

votes

0

answers

131

views

Determining if transducer automaton has two states with intersecting images, without minimizing?

automata-theory minimization

Jun 6 '20 at 14:51 grok 181

8

votes

3

answers

759

views

Is this vertex ordering optimization NP-Hard?

graph-theory np-hardness permutations

Mar 16 at 15:47 Hermann Gruber 5,214

7

votes

1

answer

1k

views

Test set and benchmarks for linear programming

reference-request linear-programming

Jun 2 '13 at 18:42 Austin Buchanan 1,616

6

votes

1

answer

313

views

Complexity of finding the largest induced subgraph with all even degrees

graph-theory graph-algorithms np-complete

Dec 1 '19 at 1:06 Antti Röyskö 551

6

votes

2

answers

312

views

Infinite process balls in bins problem

pr.probability

Feb 10 '20 at 9:09 Rob Johnson 46

Stack Exchange Network

current community

your communities

more stack exchange communities

Next badge

55 Bookmarks

Examples of the price of abstraction?

What are the recent TCS books whose drafts are available online?

Problems that can be used to show polynomial-time hardness results

Problem unsolvable in $2^{o(n)}$ on inputs with $n$ bits, assuming ETH?

Data for testing graph algorithms

Optimal greedy algorithms for NP-hard problems

Combinatorics of Bellman-Ford or how to make cyclic graphs acyclic?

The complexity of checking whether two DAG have the same number of topological sorts

Rank mod 6 vs rank over the reals

Is Hankelability NP-hard?

Can we decide whether a permanent has a unique term?

Complexity of interval cover problem

Avalanche like stochastic process

Complexity of approximating the range of a matrix

Sylver Coinage Game

Comparing the Kolmogorov complexity of theories

Probability that a random sorting network works

Is it possible to find the median with a linear size sorting network?

Is this optimum travelling problem under deadlines NP-hard on trees?

Exact Algorithm for edge labeling problem in DAG

How good is greedy in average?

Set optimization problem - is it np-complete?

Optimal bee swarm plots: NP-hard?

Bounds on this Strategy for Separating Words

Cheap online selection with weighted comparisons

Determining if transducer automaton has two states with intersecting images, without minimizing?

Is this vertex ordering optimization NP-Hard?

Test set and benchmarks for linear programming

Complexity of finding the largest induced subgraph with all even degrees

Infinite process balls in bins problem