Tour
About Us
Meta
Loading…
Log in
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Stack Exchange
All Sites
Top Users
Digests
Avi Tal
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
10
votes
Relatively low ambitious frontiers
cc.complexity-theory
soft-question
quantum-computing
asked Oct 12 '18 at 7:37
cstheory.stackexchange.com
9
votes
Indications that strengthen the conjecture: NEXP ⊊ EXP^NP
complexity-classes
oracles
nexp
asked Sep 6 '18 at 1:03
cstheory.stackexchange.com
6
votes
Algorithm for identifying unprovable statements
ds.algorithms
computability
asked Sep 30 '18 at 15:40
cstheory.stackexchange.com
5
votes
Are there languages in $DTIME(2^{t(n)})$ that are not in $NTIME(t(n))$?
complexity-classes
asked May 17 '18 at 11:06
cstheory.stackexchange.com
Top Answers
20
Most important new papers in computational complexity
cstheory.stackexchange.com
9
Any fundamental papers in TCS which were found to be incorrect/wrong later?
cstheory.stackexchange.com
9
Is there any online lecture series that covers “Computational Complexity: A Modern Approach”?
cstheory.stackexchange.com
8
Implications of unprovability of $P\neq NP$
cstheory.stackexchange.com
7
Conesequences of $\forall k\in \mathbb N \space NP\not\subseteq TISP(poly(n),n^k)$
cstheory.stackexchange.com
6
Why should we believe that $NEXP \not \subset P/poly$
cstheory.stackexchange.com
5
Problems that started out with hopelessly intractable algorithms that have since been made extremely efficient
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com