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.
Hardness of approximation Hardness of approximation In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Hardness of approximation complements the study of approximation algorithms by proving, for certain problems, a limit on the factors with which their solution can be efficiently approximated. Typically such limits show a factor of approximation beyond which a problem becomes NP-hard, implying that finding a polynomial time approximation for the problem is impossible unless NP=P. Some hardness of approximation results, however, are based on other hypotheses, a notable one among which is the unique games conjecture.