Degree+of+hardness
101Ballistic vest — A ballistic vest is an item of protective clothing that absorbs the impact from gun fired projectiles and shrapnel fragments from explosion. This protection is for the torso. Soft vests are made from many layers of woven or laminated fibers and… …
102Edmond La Beaume Cherbonnier — Edmond La B. Cherbonnier American scholar of religious studies and professor Born February 11, 1918 (1918 02 11) (age 93) Saint Louis, Missouri Nationality …
103Shore durometer — Two inline skates wheels with different durometer 85A and 83A. Durometer is one of several measures of the hardness of a material. Hardness may be defined as a material s resistance to permanent indentation. The durometer scale was defined by… …
104Feedback vertex set — In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… …
105scale — 1. A standardized test for measuring psychological, personality, or behavioral characteristics. SEE ALSO: score, test. 2. SYN: squama. 3. A small thin plate of horny epithelium, resembling a fish s., cast off from the skin …
106Decisional Diffie–Hellman assumption — The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic groups. It is used as the basis to prove the security of many cryptographic protocols, most… …
107Water purification — This article is about large scale, municipal water purification. For portable/emergency water purification, see portable water purification. For industrial water purification, see deionized water. For distilled water, see distilled water. Water… …
108Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …
109Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …
110Alloy — This article is about the type of material. For the specification language, see Alloy (specification language). For lightweight auto wheels, see alloy wheel. Steel is a metal alloy whose major component is iron, with carbon content between 0.02%… …
