Theoretical Computer Science
exfret's user avatar
exfret's user avatar
exfret's user avatar
exfret
  • Member for 6 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
633
reputation
3k
reached
1
answer
11
questions
top 31% overall
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
11
bronze badges
Top tags
View all tags
5
Score
2
Posts
17
Posts %
5
Score
2
Posts
17
Posts %
0
Score
5
Posts
42
Posts %
0
Score
4
Posts
33
Posts %
0
Score
2
Posts
17
Posts %
0
Score
2
Posts
17
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
8
Are all turing machines paths predictable?
Nov 28, 2018
question
8
Lower bound on pebbling numbers
Aug 28, 2019
question
7
Are space and time hierarchies even comparable?
Feb 17, 2018
question
5
What research is being done in classical complexity theory?
Mar 17, 2020
question
5
Turing machines over a structure
Dec 25, 2017
answer
5
How long does it take to find a short cycle in a random graph?
Sep 21, 2019
question
4
Is $L\subset NC^1$
Mar 17, 2018
question
2
Is $SUBLOG\subset DTIME(n)$?
Mar 17, 2018
question
2
Complexity of comparing extended integer power towers
Mar 31, 2019
question
2
What is the communication complexity of approximating addition?
Jun 27, 2019
Top network posts
View all network posts
26
What sorts of extra axioms might we add to ZFC to compute higher Busy Beaver numbers?
6
Definability of ordinals in various signatures

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.