Olea capensis wood materials. It is also the one of the world's hardest woods according to the Janka hardness test. The timber has a good abrasion resistance and is very strong. It is an excellent turnery wood, and is used for a wide range of decorative items. Olea capensis Olea capensis, also known by the common name black ironwood, is an African tree species belonging to the Olive family (Oleaceae). It is widespread in Sub-Saharan Africa from the east in Somalia, Ethiopia and Sudan, south to the tip of South Africa, and west to Cameroon, Sierra Leone and the Islands of the
Computational hardness assumption 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 rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood. Computational hardness assumptions are of particular importance in cryptography. A major goal in cryptography is to create cryptographic primitives with provable security. In some cases, cryptographic protocols are found