Reputation
Badges
0 0 0
Impact
0 people reached

17h
reviewed Approve Proof of an Optimal substructure in Dynammic Programming?
2d
reviewed Approve Given two total Turing machines, is it undecidable problem to detect whether they give the same output on all inputs?
Aug
27
reviewed Approve Segmentation and paging
Aug
24
accepted Pumping lemma regular language can't be pumped
Aug
24
reviewed Approve Why is the class NP-Complete important compared to NP-hard?
Aug
23
reviewed Reject How can a language whose compiler is written in C ever be faster than C?
Aug
19
reviewed Reject Complexity for finding zeroes of sum of cosines
Aug
18
revised Assigning edge weights under shortest path constraints
Added definition of weight of path
Aug
14
reviewed Approve How can I prove that scheduling problem F2//Lmax is NP-Hard?
Aug
13
reviewed Approve The runtime of a neural net with given numbers of observations, features, and neurons
Aug
8
reviewed Approve Complexity of recursive Fibonacci algorithm
Aug
8
reviewed Approve Why is f(n) of class O(g(n)) in this graph?
Aug
8
reviewed Approve Amortized analysis for doubling resizing array is ~3n
Aug
5
reviewed Approve Why do reductions to NP-complete problems in NTIME(n) not break the nondeterministic time hierarchy?
Aug
4
reviewed Approve Do sparse graphs have to be large?
Aug
4
reviewed Approve Possible paths in pipe network, without loops and with some one-way valves
Aug
3
reviewed Approve Merging of two convex polygon chains in O(log n)
Aug
3
wiki
Jul
17
reviewed Approve Divide and Conquer 3D Convex Hull
Jul
16
reviewed Reject Running time for threshold function evaluation?