mockerell

7 ms·

1.
by mockerell 1mo ago
A personal favorite of mine is fixed-parameter tractability. Instead of analysing the worst case running time solely on the input length we introduce a *parameter* and study the time complexity in both. Intuitively, the parameter „should“ b
2.
by mockerell 1mo ago
It is indeed very interesting. For the latter the concepts from fine-grained complexity and average time are interesting. For specific problems, there are theoretical fine grained lower bounds for time complexity (i.e. cannot be solved in (
3.
by mockerell 1mo ago
You’re right, it doesn’t. However, in TSP you are allowed to visit each vertex *exactly* once. So traversing the minimum spanning tree naively is not a valid solution. What you the approximation does is to „shortcut“ the paths if you would
4.
Nerd culture is murdering intellectuals(theintrinsicperspective.com)
54 points by mockerell 2mo ago|71 comments
5.
by mockerell 3mo ago
That’s an interesting way to think about it. While tests don’t satisfy mathematicians‘ standards for rigor one could instead look at interactive proofs from complexity theory. These are of interest if a problem doesn’t allow for short proof
6.
by mockerell 3mo ago
Look no further! SailGP is pretty much the maritime version of F1
7.
by mockerell 3mo ago
I just wanted to tell you that I wholeheartedly agree with your statement and that you shouldn’t be discouraged by some of the nay-sayers in the replies. I feel that HN has many users who are techno-optimist, but are very pessimistic of the
8.
by mockerell 4mo ago
The lack of actual photos of Labubus "in the real" (usually on a keychain at a pant's belt loops) is jarring. The topic of the "performative male" has been regurgitated in social media for quite some time. Still the
9.
by mockerell 1y ago
How does it fit into this xkcd? https://xkcd.com/977/
10.
by mockerell 1y ago
I think the comment referred to the phrase „a graph needs X (colors or whatever)“. For me, this can be read two ways: 1. „a graph always needs at least X colors“ or 2. „a graph always needs at most X colors“. Personally, I would interpret t