User András Salamon

8 votes

Accepted

Does Rabin/Yao exist (at least in a form that can be cited)?

ho.history-overview communication-complexity

answered Apr 19, 2017 at 9:11

1 vote

Reduction from independent set in hypergraphs to independent set in graphs

answered Jul 16, 2016 at 19:24

6 votes

How many tautologies are there?

co.combinatorics lo.logic sat

answered Apr 18, 2016 at 13:13

2 votes

Accepted

Packing $n$ objects into $m$ bins whose size is variable

polynomial-time heuristics packing greedy-algorithms

answered Feb 15, 2016 at 15:50

6 votes

Accepted

Fully linear time regular expression matching

regular-expressions parsing

answered Aug 10, 2015 at 19:30

4 votes

Problems Between P and NPC

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

answered Aug 3, 2015 at 10:17

10 votes

Can a hereditary graph class contain almost all, but not all, n-vertex graphs?

graph-theory

answered Jul 30, 2015 at 13:46

4 votes

Accepted

Evidence that UniqueSat is dense

cc.complexity-theory unique-solution

answered Jul 27, 2015 at 14:47

7 votes

Lipton's most influential results

big-list

answered May 29, 2015 at 16:59

23 votes

Accepted

Complexity zoo for unary languages

cc.complexity-theory reference-request big-list

answered May 11, 2015 at 15:00

6 votes

Research problems in communication complexity

big-list communication-complexity research-practice open-problem survey

answered Mar 12, 2015 at 17:30

52 votes

Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming

soft-question sat terminology

answered Feb 9, 2015 at 16:04

2 votes

Low space computation and branching program

cc.complexity-theory reference-request circuit-complexity space-bounded space-complexity

answered Jan 5, 2015 at 16:45

3 votes

Accepted

Best current space lower bound for SAT?

cc.complexity-theory sat lower-bounds space-bounded space-complexity

answered Dec 17, 2014 at 15:59

10 votes

The unreasonable power of non-uniformity

cc.complexity-theory complexity-classes big-picture

answered Apr 30, 2014 at 11:25

9 votes

Accepted

Planted Clique in G(n,p), varying p

cc.complexity-theory approximation-algorithms approximation-hardness

answered Apr 16, 2014 at 11:00

6 votes

Learnability of constraint satisfaction problems CSPs?

reference-request machine-learning lg.learning csp

answered Apr 11, 2014 at 11:30

7 votes

Deterministic communication complexity vs partition number

lower-bounds communication-complexity

answered Mar 26, 2014 at 22:46

1 vote

Major unsolved problems in theoretical computer science?

big-list open-problem

answered Feb 28, 2014 at 17:56

4 votes

Using Kolmogorov complexity as input "size"

cc.complexity-theory kolmogorov-complexity parameterized-complexity succinct analysis-of-algorithms

answered Feb 27, 2014 at 22:56

4 votes

Nontrivial membership in NP

reductions np

answered Feb 17, 2014 at 19:11

13 votes

Nontrivial membership in NP

reductions np

answered Feb 17, 2014 at 18:34

7 votes

Why are so few natural candidates for NP-intermediate status?

cc.complexity-theory p-vs-np np-intermediate

answered Feb 10, 2014 at 9:47

7 votes

Justifying asymptotic worst-case analysis to scientists

cc.complexity-theory reference-request big-picture application-of-theory worst-case

answered Jan 30, 2014 at 20:59

15 votes

Is Almost-2-SAT NP-hard?

np-hardness sat upper-bounds

answered Dec 20, 2013 at 13:05

1 vote

Questions about special types of partial assignments

cc.complexity-theory lo.logic sat

answered Nov 10, 2013 at 18:37

14 votes

Overarching reasons why problems are in P or BPP

big-list big-picture

answered Oct 4, 2013 at 16:27

19 votes

Overarching reasons why problems are in P or BPP

big-list big-picture

answered Oct 3, 2013 at 16:38

19 votes

A simple decision problem whose decidability is not known

computability decidability

answered Sep 4, 2013 at 22:00

10 votes

Examples of hardness phase transitions

cc.complexity-theory counting-complexity approximation-hardness phase-transition

answered Jul 15, 2013 at 16:18

Stack Exchange Network

current community

your communities

more stack exchange communities

113 Answers

Does Rabin/Yao exist (at least in a form that can be cited)?

Reduction from independent set in hypergraphs to independent set in graphs

How many tautologies are there?

Packing $n$ objects into $m$ bins whose size is variable

Fully linear time regular expression matching

Problems Between P and NPC

Can a hereditary graph class contain almost all, but not all, n-vertex graphs?

Evidence that UniqueSat is dense

Lipton's most influential results

Complexity zoo for unary languages

Research problems in communication complexity

Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming

Low space computation and branching program

Best current space lower bound for SAT?

The unreasonable power of non-uniformity

Planted Clique in G(n,p), varying p

Learnability of constraint satisfaction problems CSPs?

Deterministic communication complexity vs partition number

Major unsolved problems in theoretical computer science?

Using Kolmogorov complexity as input "size"

Nontrivial membership in NP

Nontrivial membership in NP

Why are so few natural candidates for NP-intermediate status?

Justifying asymptotic worst-case analysis to scientists

Is Almost-2-SAT NP-hard?

Questions about special types of partial assignments

Overarching reasons why problems are in P or BPP

Overarching reasons why problems are in P or BPP

A simple decision problem whose decidability is not known

Examples of hardness phase transitions