Viewing profile — Mgccl

Yes. K_{3,3} can be embedded on a torus.

Theory cs could care less about coding abilities. It's never a bad thing to know how to code, but I can go though the entire PhD program without coding a single line of code. (Well…

It's hard for someone in anything remote to math/science without coding anything in their entire undergraduate life. It's like you say no one can be admitted to a PhD program in US…

1. There is no proof that pi is a normal number. 2. The index of the position takes up space.

mathematician make errors. I want something that can be checked formally.

This is why I think it be important to have a language designed to express algorithms and can be verified of correctness to a certain point.

I haven't done any statistical surveys, in my undergrad years, I find math students are much smarter than the cs majors.

Why do you care about the high demand? We can put that aside for now--if you are a competent coder, you are in high demand... If you want to have more math, then some subfield in C…

It could mean "2/3 of the men who took the survey admit to watching porn" for w/e survey they had in mind...

How about "Math beyond arithmetic is not important at all for the vast majority of adults today."

See the updated content in the link and the code in here http://www.chaoxuprime.com/posts/2013-08-16-more-algorithms-... Both in Haskell. you can see how to implement it from scrat…

This is a common technique of switching between two algorithms. iirc, I never saw this as an material in undergrad algorithms course. I wrote on another problem that uses this tech…

Google Analytics has a filter system that allow one to use regular expressions of length at most 255. Sometimes, people have long list of strings that have total length more than 2…

Since I'm a CS theory person, I can offer some theoretical improvements on the running time and make the problem even more general... Instead of minimize the linear difference of p…

I thought you would want the most negative cycle, which would be NP-hard to find.

Let's put some algebra/order into this... Bellman-Ford works for any totally ordered group (G,+), such that a+b What logarithm does is just a order preserving homomorphism from (R,…

true. irrc there is only a constant factor of time difference between the two.

I see his point, I'm not attacking that. I'm not happy about him didn't do enough research on the topic to find more recent results? Or talk with a real algorithms professor about …

Good article, but it only demonstrate his ignorance on existing cache-oblivious data structures...