Theoretical Computer Science
adrianN's user avatar
adrianN's user avatar
adrianN's user avatar
adrianN
  • Member for 11 years
  • Last seen more than 2 years ago
Profile Activity
Stats
877
reputation
18k
reached
7
answers
2
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
13
bronze badges
Top tags
View all tags
18
Score
4
Posts
44
Posts %
14
Score
2
Posts
22
Posts %
11
Score
1
Posts
11
Posts %
11
Score
1
Posts
11
Posts %
11
Score
1
Posts
11
Posts %
11
Score
1
Posts
11
Posts %
Top posts
All Questions Answers
Score Newest
question
39
Efficient and simple randomized algorithms where determinism is difficult
Nov 20, 2012
answer
19
Polynomial-time algorithms with huge exponent/constant
Dec 7, 2012
answer
11
Coloring complexity of graphs
Nov 22, 2012
answer
7
Probabilistic (randomized) algorithms before "modern" computer science appeared
Dec 9, 2012
answer
7
Is there any work on purely functional approximation algorithms?
Feb 6, 2013
answer
7
"lambda" term usage in programming
Jul 24, 2013
answer
2
Algorithms in preprocessed universe
Jan 3, 2017
question
2
Impractical problems in P [duplicate]
Dec 6, 2012
answer
2
Proof of non-existence of the universal archiver?
Feb 25, 2013
Top network posts
View all network posts
21
What should I do with a bunch of 16-17 year olds to get them interested in computer science?
15
How is PowerPoint Turing complete?
14
How to prove greedy algorithm is correct
12
An one-sentence proof of P ⊆ NP
11
What is an Efficient Algorithm?

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.