Scratch hardness Scratch hardness Scratch hardness tests are used to determine the hardness of a material to scratches and abrasion. The earliest test was developed by mineralogist Friedrich Mohs in 1820 (see Mohs scale). It is based on relative scratch hardness, with talc assigned a value of 1 and diamond assigned a value of 10. Mohs' scale had two limitations; it was not linear, and most modern abrasives fall between 9 and 10. Raymond R. Ridgway, a research engineer at the Norton Company, modified the Mohs scale by giving garnet a hardness of 10 and diamond a hardness of 15. Charles E.
Computational hardness assumption algorithm for 3SUM, and it has been conjectured that no algorithm can solve 3SUM in "truly sub-quadratic time": the 3SUM Conjecture is the computational hardness assumption that there are no formula_87-time algorithms for 3SUM (for any constant formula_88). This conjecture is useful for proving near-quadratic lower bounds for several problems, mostly from computational geometry. Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where "efficiently" typically means "in polynomial time"). It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists