May
6
awarded Popular Question
May
4
awarded Good Question
Apr
23
awarded Yearling
Apr
23
awarded Yearling
Apr
17
awarded Critic
Apr
14
awarded Critic
Mar
13
awarded Popular Question
Feb
5
awarded Popular Question
Jan
28
awarded Notable Question
Jan
26
asked How does frontend and backend communicate in gcc
Dec
1
awarded Notable Question
Nov
4
awarded Nice Question
Nov
4
comment Average time to solve maze through backtracking
Try to think how many times you will backtrack in average
Nov
4
comment Average time to solve maze through backtracking
@GabrielRatener "The average height of the tree seems irrelevant in this case, since the algorithm must backtrack through multiple branches until it finds a series of branches that lead to a solution." The algorithm could have found the solution in the first branch it visits without ever having to backtrack. You need to look at average case, not worst case
Nov
4
answered Average time to solve maze through backtracking
Oct
14
awarded Commentator
Oct
10
comment Proving NP-hardness of strange graph partition problem
Try reduction to the subset-sum problem?
Oct
10
comment Set containment of MinimumBadPrefix and BadPrefix of a Safety Property
Thanks for the hint, I figured it out.
Oct
9
comment If both the concatenation of two languages and the second "half" are regular, is the first too?
for your concrete question, try drawing down the DFA and see what you can find.
Oct
9
awarded Supporter
1 2 3 4 5