Janka hardness test understand which woods are harder than others. Janka hardness test The Janka hardness test (from the Austrian-born emigrant Gabriel Janka, 1864-1932) measures the resistance of a sample of wood to denting and wear. It measures the force required to embed an diameter steel ball halfway into a sample of wood. A common use of Janka hardness ratings is to determine whether a species is suitable for use as flooring. The hardness of wood varies with the direction of the wood grain. Testing on the surface of a plank, perpendicular to the grain, is said to be of "side hardness". Testing
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.