jmblpati

3 ms·

1.
by jmblpati 4y ago
I don't know what specific problem Kelley and Meka were working on, but the connection between arithmetic progression free sets and computer science (especially communication complexity) is somewhat well established. See for example th
2.
by jmblpati 6y ago
Strassen is reasonably numerically stable (although not as good as the naive algorithm), and everything beyond Strassen is extremely unstable. This is due to a trick that many of these algorithms employ: you technically only need to do mult
3.
by jmblpati 6y ago
The constants are galactic: any 'fast matrix multiplication' algorithm outside of Strassen's algorithm has some incredible constants that are somewhat intrinsic to the recursive framework. The algorithm is primarily of theore
4.
by jmblpati 6y ago
A small clarification: this trick is not new. It was discovered very early on in the investigation of the Wii VC release of Super Mario 64. It was rediscovered by a group of people who were interested in an application of it (which enables
5.
by jmblpati 8y ago
I think there's an easier to visualize solution to the box problem. Let A have dimensions (a,b,c) and let B have dimensions (x,y,z). Assume A fits inside B. We have (a+b+c)^2 = a^2 + b^2 + c^2 + 2ab + 2ac + 2bc. This is the sum of the
6.
by jmblpati 8y ago
No, pretty much all serine hydrolases are affected by organophosphates (assuming they can reach the active site). For example, the compounds IDFP[0] and MAFP[1] can both be used to inhibit serine hydrolase activity in vitro. Diisopropyl flu
7.
by jmblpati 8y ago
...which is a serine hydrolase.
8.
by jmblpati 8y ago
Your claim about fluorine being essential for organophosphate nerve agents is incorrect. The original nerve agent, tabun, contains no fluorine at all for example. Neither do VX, parathion, or paraoxon. The mechanism behind organophosphate p
9.
by jmblpati 9y ago
Quick addendum: although the four color theorem proof always seems to require a case analysis at some point, proving that planar graphs admit 5-colorings can be done with a very short proof. Not particularly relevant to the analogy in the p