User Neal Young

120 votes

18 answers

9k views

Examples of the price of abstraction?

Joshua Grochow

35.7k

asked Aug 26, 2010 at 4:00

103 votes

39 answers

14k views

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

reference-request big-list books

Rahab

301

asked Dec 5, 2010 at 2:01

65 votes

5 answers

2k views

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

cc.complexity-theory lower-bounds conditional-results

Robin Kothari

13.3k

asked Sep 14, 2010 at 2:56

46 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

Michael Lampis

3,094

asked Jan 19, 2013 at 16:24

40 votes

10 answers

13k views

Data for testing graph algorithms

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

Chris

asked Aug 29, 2010 at 14:02

38 votes

9 answers

4k views

Optimal greedy algorithms for NP-hard problems

cc.complexity-theory lower-bounds approximation-algorithms greedy-algorithms approximation-hardness

Shiva Kintali

10.5k

asked Sep 13, 2010 at 2:01

32 votes

0 answers

6k views

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

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

Stasys

6,605

asked Dec 3, 2012 at 15:49

30 votes

0 answers

740 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

Mike Chen

709

asked Nov 17, 2010 at 22:21

27 votes

0 answers

698 views

Is Hankelability NP-hard?

cc.complexity-theory

graffe

3,920

asked Apr 16, 2015 at 17:44

26 votes

0 answers

607 views

Rank mod 6 vs rank over the reals

linear-algebra matrices boolean-matrix

Shachar Lovett

746

asked Jun 7, 2017 at 16:57

19 votes

2 answers

1k views

Can we decide whether a permanent has a unique term?

cc.complexity-theory ds.algorithms matrices matching permanent

domotorp

13.5k

asked Oct 8, 2010 at 8:17

18 votes

1 answer

2k views

Complexity of interval cover problem

cc.complexity-theory np-hardness

Torsten Mütze

181

asked May 6, 2013 at 12:39

17 votes

0 answers

557 views

Sylver Coinage Game

co.combinatorics combinatorial-game-theory

user17918

asked Apr 14, 2014 at 11:03

16 votes

2 answers

541 views

Avalanche like stochastic process

pr.probability markov-chains stochastic-process

Matthias

1,638

asked Nov 7, 2010 at 17:49

15 votes

0 answers

369 views

Complexity of approximating the range of a matrix

cc.complexity-theory approximation-algorithms linear-algebra

graffe

3,920

asked Jan 28, 2016 at 10:00

14 votes

1 answer

399 views

Probability that a random sorting network works

sorting-network

Geoffrey Irving

3,221

asked Feb 28, 2018 at 16:47

14 votes

0 answers

471 views

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

ds.algorithms sorting sorting-network selection

domotorp

13.5k

asked Dec 9, 2014 at 14:40

14 votes

3 answers

523 views

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

ds.algorithms graph-algorithms np-hardness

Peng Zhang

1,423

asked Feb 7, 2012 at 17:40

14 votes

1 answer

606 views

Exact Algorithm for edge labeling problem in DAG

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

user5153

333

asked Jan 31, 2012 at 15:55

13 votes

1 answer

506 views

Comparing the Kolmogorov complexity of theories

lo.logic kolmogorov-complexity

Russell Easterly

499

asked Feb 3, 2015 at 4:15

12 votes

0 answers

358 views

How good is greedy in average?

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

Stasys

6,605

asked May 17, 2015 at 20:58

10 votes

2 answers

723 views

Set optimization problem - is it np-complete?

np-hardness optimization

Nasooh

101

asked Jan 12, 2012 at 20:12

9 votes

0 answers

152 views

Optimal bee swarm plots: NP-hard?

np-hardness cg.comp-geom

Falk Hüffner

1,023

asked Oct 27, 2019 at 11:52

9 votes

2 answers

351 views

Bounds on this Strategy for Separating Words

automata-theory dfa

Zach Hunter

507

asked Jul 28, 2020 at 16:25

8 votes

2 answers

265 views

Cheap online selection with weighted comparisons

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

George

664

asked Aug 8, 2012 at 12:05

8 votes

0 answers

140 views

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

automata-theory minimization

grok

181

asked Jun 4, 2020 at 10:06

8 votes

3 answers

852 views

Is this vertex ordering optimization NP-Hard?

graph-theory np-hardness permutations

maxdan94

533

asked May 22, 2017 at 12:54

7 votes

1 answer

2k views

Test set and benchmarks for linear programming

reference-request linear-programming

shuhalo

1,145

asked Mar 16, 2013 at 20:35

6 votes

1 answer

371 views

Complexity of finding the largest induced subgraph with all even degrees

graph-theory graph-algorithms np-complete

Andras Farago

10.7k

asked Nov 18, 2019 at 20:23

6 votes

2 answers

340 views

Infinite process balls in bins problem

pr.probability

Mister R

201

asked Feb 7, 2019 at 17:17

Stack Exchange Network

current community

your communities

more stack exchange communities

63 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

Is Hankelability NP-hard?

Rank mod 6 vs rank over the reals

Can we decide whether a permanent has a unique term?

Complexity of interval cover problem

Sylver Coinage Game

Avalanche like stochastic process

Complexity of approximating the range of a matrix

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

Comparing the Kolmogorov complexity of theories

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