Skip to main content
Theoretical Computer Science
Eric Allender's user avatar
Eric Allender's user avatar
Eric Allender's user avatar
Eric Allender
  • Member for 13 years, 10 months
  • Last seen this week
Profile Activity
Stats
2,186
reputation
51k
reached
21
answers
0
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
23
silver badges
17
bronze badges
Top tags
View all tags
125
Score
11
Posts
52
Posts %
28
Score
6
Posts
29
Posts %
24
Score
3
Posts
14
Posts %
23
Score
2
Posts
10
Posts %
21
Score
2
Posts
10
Posts %
17
Score
2
Posts
10
Posts %
Top posts
View all questions and answers
41
Are the problems PRIMES, FACTORING known to be P-hard?
Aug 30, 2011
30
Problems Between P and NPC
Sep 28, 2010
27
Is finding Logspace reductions harder than P reductions?
Aug 13, 2013
14
Relativization with Respect to Non-Recursive Oracles
Sep 28, 2010
12
How stringent is the peer review process of ECCC exactly?
May 8
9
Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers?
Nov 28, 2017
9
Is Circuit Minimization $P$-hard under logspace reductions?
Oct 5, 2023
9
What are the computations model with a constant slowdown ? (and why do we care about Turing machines)
Jul 16
8
Does $NC=P$ imply the collapse of Polynomial Hierarchy?
Sep 12, 2023
8
Fast algorithms for time bounded Kolmogorov complexity
Sep 26, 2023