2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Avi Tal
  • Member for 4 years
  • Last seen this week
Profile Activity
Stats
1,456
reputation
72k
reached
28
answers
6
questions
Communities
View all
Badges
View all badges
1
gold badge
7
silver badges
11
bronze badges
Top tags
View all tags
42
Score
12
Posts
35
Posts %
19
Score
7
Posts
21
Posts %
11
Score
3
Posts
9
Posts %
8
Score
2
Posts
6
Posts %
7
Score
4
Posts
12
Posts %
6
Score
3
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
20
Most important new papers in computational complexity
Jun 24, 2019
question
10
Relatively low ambitious frontiers
Oct 12, 2018
question
9
Indications that strengthen the conjecture: NEXP ⊊ EXP^NP
Sep 6, 2018
answer
9
Any fundamental papers in TCS which were found to be incorrect/wrong later?
May 30, 2020
answer
9
Is there any online lecture series that covers "Computational Complexity: A Modern Approach"?
Nov 8, 2020
answer
8
Implications of unprovability of $P\neq NP$
Nov 27, 2019
answer
7
Conesequences of $\forall k\in \mathbb N \space NP\not\subseteq TISP(poly(n),n^k)$
Sep 2, 2018
question
6
Algorithm for identifying unprovable statements
Sep 30, 2018
answer
6
Why should we believe that $NEXP \not \subset P/poly$
Jan 18, 2021
answer
5
Problems that started out with hopelessly intractable algorithms that have since been made extremely efficient
Jan 26, 2021
Top Meta posts
1
0
5
Renaming this forum

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.