Computer Science
Kurt Mueller's user avatar
Kurt Mueller's user avatar
Kurt Mueller's user avatar
Kurt Mueller
  • Member for 9 years, 4 months
  • Last seen more than 2 years ago
Profile Activity
Stats
743
reputation
9k
reached
10
answers
1
question
Communities
View all
About

Undergraduate at Carnegie Mellon

Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
10
bronze badges
Top tags
View all tags
17
Score
4
Posts
36
Posts %
15
Score
4
Posts
36
Posts %
12
Score
2
Posts
18
Posts %
12
Score
2
Posts
18
Posts %
12
Score
2
Posts
18
Posts %
12
Score
2
Posts
18
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
11
Direct NP-Complete proofs
Aug 30, 2014
question
8
Exponential analogue of NC?
Sep 22, 2014
answer
7
Halting problem without self-reference
Aug 7, 2014
answer
5
Connection of "modern" runtimes and number of steps on a Turing machine
Aug 11, 2014
answer
5
Decide if a specific Turing machine halts on a specific string
Sep 4, 2014
answer
4
Are conditionals necessary in computation?
Oct 30, 2014
answer
4
Are there parallel matrix exponentiation algorithms that are more efficient than sequential multiplication?
Aug 19, 2016
answer
4
How do I interpret the wording of this passage about abstract binding trees from the book Practical Foundations of Programming Languages
Nov 23, 2016
answer
3
Generating hard puzzles for a backtracking snake
Aug 11, 2014
answer
2
If h(n) is a perfect heuristic (that is, h(n) = h*(n)), then does it imply that A* will always take linear time complexity?
Oct 20, 2017
Top network posts
View all network posts
13
NEXPTIME-completeness with more time for reductions

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.