Skip to main content
Computer Science
templatetypedef's user avatar
templatetypedef's user avatar
templatetypedef's user avatar
templatetypedef
  • Member for 12 years, 5 months
  • Last seen more than a week ago
Profile Activity
Stats
9,222
reputation
501k
reached
60
answers
43
questions
Communities
View all
About

I love teaching, learning, and that really great feeling you get when you finally understand something.

Badges
View all badges
1
gold badge
31
silver badges
60
bronze badges
Top tags
View all tags
276
Score
13
Posts
13
Posts %
65
Score
15
Posts
15
Posts %
53
Score
12
Posts
12
Posts %
49
Score
8
Posts
8
Posts %
48
Score
19
Posts
18
Posts %
43
Score
9
Posts
9
Posts %
Top posts
View all questions and answers
answer
234
BIT: What is the intuition behind a binary indexed tree and how was it thought about?
Mar 15, 2013
question
29
Are there any specific problems known to be undecidable for reasons other than diagonalization, self-reference, or reducibility?
Dec 26, 2015
answer
26
How does a computer work?
Sep 1, 2012
question
21
Is the "subset product" problem NP-complete?
Jan 12, 2013
answer
20
How to show that a "reversed" regular language is regular
Aug 20, 2012
question
17
Which languages are recognized by one-counter machines?
Dec 24, 2012
answer
17
Are regular expressions $LR(k)$?
Jul 11, 2012
question
16
Complexity classes pertaining to listing all solutions?
Sep 13, 2016
answer
15
What is practical difference between NP and PSPACE-complete?
Jun 18, 2015
answer
15
Does a never-halting machine always loop?
Jul 13, 2012
Top Meta posts
2
0
3
What would a proper answer of the form "no, what you're describing doesn't exist" look like?
Top network posts
View all network posts
617
How to use range-based for() loop with std::map?
571
What is the difference between LL and LR parsing?
339
Infinite recursion in JavaScript quicksort?
327
What is pseudopolynomial time? How does it differ from polynomial time?
314
What would cause an algorithm to have O(log n) complexity?