Indentation hardness test, performed with either 3 gf or 9 gf loads, preceded the development of microhardness testers using traditional indenters. In 1925, Smith and Sandland of the UK developed an indentation test that employed a square-based pyramidal indenter made from diamond. They chose the pyramidal shape with an angle of 136° between opposite faces in order to obtain hardness numbers that would be as close as possible to Brinell hardness numbers for the specimen. The Vickers test has a great advantage of using one hardness scale to test all materials.The first reference to the Vickers indenter with low loads was made
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.