problem — an unwanted and often irreversible condition The word is used in many phrases to conceal truth or inadequacy. Thus a cash problem in an individual is a shortage of money, and not a superfluity or a lack of pockets to put it in. In a company … How not to say what you mean: A dictionary of euphemisms
weight — 1 /weIt/ noun 1 WHAT SB/STH WEIGHS (C, U) how heavy something is when measured by a particular system: The average weight of a baby at birth is just over seven pounds. 2 HOW FAT (U) how heavy and especially how fat someone is: A lot of teenage… … Longman dictionary of contemporary English
problem — prob|lem W1S1 [ˈprɔbləm US ˈpra: ] n ▬▬▬▬▬▬▬ 1¦(difficulty)¦ 2 3¦(question)¦ 4 no problem 5 the (only) problem is (that) ... 6 that s your/his etc problem 7 it s/that s not my problem 8 What s your/his etc problem? 9 Do … Dictionary of contemporary English
weight — weight1 W2S1 [weıt] n ▬▬▬▬▬▬▬ 1¦(amount somebody/something weighs)¦ 2¦(how fat)¦ 3¦(heaviness)¦ 4¦(heavy thing)¦ 5¦(worry)¦ 6¦(importance)¦ 7¦(amount)¦ 8¦(for measuring quantities)¦ 9¦(for sport)¦ 10 throw your wei … Dictionary of contemporary English
Weight gain — is an increase in body weight. This can be either an increase in muscle mass, fat deposits, or excess fluids such as water. DescriptionIn some cases, weight gain can also occur as a result of developing tumors or other abnormal growths. Muscle… … Wikipedia
weight — [[t]we͟ɪt[/t]] ♦♦ weights, weighting, weighted 1) N VAR: oft amount in N, with poss, N of amount The weight of a person or thing is how heavy they are, measured in units such as kilograms, pounds, or tons. What is your height and weight?... This… … English dictionary
weight — noun 1 amount sth weighs ADJECTIVE ▪ considerable, enormous, great, heavy, immense ▪ light ▪ extra ▪ … Collocations dictionary
Numerical sign problem — The numerical sign problem refers to the difficulty of numerically evaluating the integral of a highly oscillatory function of a large number of variables. Numerical methods fail because of the near cancellation of the positive and negative… … Wikipedia
Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia