User Huck Bennett - Theoretical Computer Science Stack Exchange

Huck Bennett

Member for 13 years, 2 months
Last seen this week

users.eecs.northwestern.edu/…
Evanston, IL

28 Answers

Score Activity Newest

41 votes

Core algorithms deployed

answered Nov 12, 2013 at 16:47

36 votes

Accepted

Why is there an enormous difference between SAT solvers?

answered Jul 22, 2011 at 0:17

28 votes

Accepted

Is Quasi-polynomial time in PSPACE?

answered Oct 12, 2011 at 22:25

23 votes

Accepted

Sources of open problems?

answered Jul 7, 2017 at 17:51

22 votes

Accepted

What is known about this TSP variant?

answered May 17, 2015 at 17:44

20 votes

Accepted

Problems that are decidable but cannot be verified in polynomial time

answered Nov 29, 2010 at 22:00

18 votes

Are there any counterintuitive results in theoretical computer science?

answered Nov 23, 2010 at 8:40

18 votes

Accepted

Examples of $\Sigma_2^p$ complete problems?

answered Jul 1, 2014 at 0:45

17 votes

Accepted

What is the precise definition of Random K-SAT?

answered May 8, 2012 at 22:52

14 votes

(N)DFA with same initial/accepting state(s)

answered Jul 7, 2013 at 7:54

13 votes

What videos should everybody watch?

answered Feb 28, 2011 at 1:20

13 votes

Book on Probability

answered Apr 6, 2011 at 3:44

13 votes

Accepted

Is there a SETH (Strong Exponential Time Hypothesis) for CSP (Constraint Satisfaction Problem)?

answered Nov 20 at 19:03

12 votes

Proofs found by computer

answered Jan 14, 2013 at 5:03

11 votes

Accepted

What if a problem is both in $\Pi_2^p$ and $NP$-hard?

answered Sep 25, 2012 at 5:33

10 votes

Physics results in TCS?

answered Dec 3, 2010 at 7:40

10 votes

$\overline{SAT} \in NTIME(subexp)$?

answered Sep 12, 2015 at 21:37

7 votes

Accepted

Quantum Hardness of Approximating Lattice Problems

answered Nov 3, 2015 at 23:25

7 votes

Voronoi Diagram of Lines

answered Dec 6, 2015 at 0:58

7 votes

Banaszczyk's theorem

answered Jul 23, 2019 at 22:56

4 votes

Exercises of polynomial and turing reductions

answered Feb 11, 2011 at 4:59

4 votes

Are there languages that are not in RE nor CO-RE?

answered Nov 23, 2010 at 9:09

4 votes

PageRank for a Non-Random Searcher

answered Aug 15, 2011 at 16:37

3 votes

List of TCS conferences and workshops

answered Apr 26, 2014 at 2:01

3 votes

On lattice and code isomorphism

answered Oct 12, 2022 at 22:24

2 votes

Accepted

CVP to SVP reduction?

answered Jul 1 at 0:21

2 votes

Funny TCS-related papers etc?

answered Sep 27, 2012 at 5:10

0 votes

Accepted

Is $GapCVP_{\gamma} \in coAM$ for all $\gamma$?

answered Apr 19 at 17:53