Lonsdaleite static press or using explosives. It has also been produced by chemical vapor deposition, and also by the thermal decomposition of a polymer, poly(hydridocarbyne), at atmospheric pressure, under argon atmosphere, at . It is translucent, brownish-yellow, and has an index of refraction of 2.40 to 2.41 and a specific gravity of 3.2 to 3.3. Its hardness is theoretically superior to that of cubic diamond (up to 58% more), according to computational simulations, but natural specimens exhibited somewhat lower hardness through a large range of values (from 7 to 8 on Mohs hardness scale). The cause is speculated as being due
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.