Theoretical Computer Science
slimton's user avatar
slimton's user avatar
slimton's user avatar
slimton
  • Member for 13 years
  • Last seen more than 11 years ago
Profile Activity
Stats
1,560
reputation
20k
reached
7
answers
4
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
18
bronze badges
Top tags
View all tags
66
Score
9
Posts
82
Posts %
36
Score
3
Posts
27
Posts %
30
Score
2
Posts
18
Posts %
30
Score
2
Posts
18
Posts %
24
Score
1
Posts
9
Posts %
20
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
41
Easy decision problem, hard search problem
Oct 1, 2010
question
37
NEXP-complete problems
Nov 24, 2010
question
36
Which definition of asymptotic growth-rate should we teach?
Sep 27, 2010
answer
24
Is there a logic without induction that captures much of P?
Sep 27, 2010
answer
20
#P-complete problem whose decision version is in P
Nov 30, 2010
answer
16
NEXP-complete problems
Nov 24, 2010
question
13
Evaluating the multilinearization of an arithmetic circuit?
Nov 10, 2010
question
12
Improved lower bound on monotone circuit complexity of perfect matching?
Jan 11, 2011
answer
7
Easy decision problem, hard search problem
Oct 4, 2010
answer
7
Educational Source or Survey on Analysis of Semidefinite Program?
Nov 4, 2011
Top network posts
View all network posts
18
Most memorable titles
14
Uncomputability of the identity relation on computable real numbers

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.