-
1 knut
substantiv1. knude2. knudepunktH. er et vigtigt trafikknudepunkt
3. problem4. ubehagelig fornemmelse (hverdagssprog/slang)Jeg har altid nervøs mave, når jeg skal til eksamen
5. hushjørneDe har aldrig turdet rejse hjemmefra, aldrig set sig om i verden
6. kilometer per time (hverdagssprog/slang)T. kørte for stærkt - 200 kilometer i timen
dubbelknut; kärringknut; nackknut
dobbeltknude; kællingeknude; knold i nakken
Den gordiske knude, en tilsyneladende uløselig opgave som måske kan løses på en overraskende måde
Inpå knuten, inpå knutarna
Tæt på en selv/det hus som man bor i
-
2 knut
substantiv2. knudepunktH. er et vigtigt trafikknudepunkt3. problem4. ubehagelig fornemmelse (hverdagssprog/slang)Jeg har altid nervøs mave, når jeg skal til eksamen5. hushjørneDe har aldrig turdet rejse hjemmefra, aldrig set sig om i verden6. kilometer per time (hverdagssprog/slang)T. kørte for stærkt - 200 kilometer i timenSammensatte udtryk:dubbelknut; kärringknut; nackknut
dobbeltknude; kællingeknude; knold i nakkenSærlige udtryk:Den gordiske knude, en tilsyneladende uløselig opgave som måske kan løses på en overraskende mådeInpå knuten, inpå knutarna
Tæt på en selv/det hus som man bor i -
3 strutsmage
substantiv1. strudsemaveCarl har en strutsmage (plåtmage) och kan äta i stort sett allt utan problem
Karl har en mave der kan tåle alt og kan stort set spise hvad som helst uden problemer
См. также в других словарях:
Problem set — A problem set is a teaching tool used by many universities. Most courses in physics, math, engineering, chemistry, and computer science will give problem sets on a regular basis. [cite book last = Curzan first = Anne coauthors = Lisa Damour title … Wikipedia
Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… … Wikipedia
Problem Frames Approach — Problem Analysis or the Problem Frames Approach is an approach to software requirements analysis. It was developed by British software consultant Michael A. Jackson. The Problem Frames Approach was first sketched by Jackson in his book Software… … Wikipedia
Problem-oriented policing — (POP), coined by University of Wisconsin Madison professor Herman Goldstein, is a policing strategy that involves the identification and analysis of specific crime and disorder problems, in order to develop effective response strategies in… … Wikipedia
Set splitting — is a logical NP Complete problem which is defined as follows::: Instance : A finite set S and a collection C of finite subsets of S ;:: Query : Can the elements of S be colored with two colors, say red and green, so that no set X ∈ C has all… … Wikipedia
set against — 1. To assail 2. To compare or balance • • • Main Entry: ↑set * * * set against [phrasal verb] 1 set (something) against (something) 1 a : to compare ( … Useful english dictionary
set the alarm bells ringing — set (the) alarm bells ringing if something sets alarm bells ringing, it makes you feel worried because it is a sign that there may be a problem. Symptoms which should set alarm bells ringing are often ignored by doctors … New idioms dictionary
set alarm bells ringing — set (the) alarm bells ringing if something sets alarm bells ringing, it makes you feel worried because it is a sign that there may be a problem. Symptoms which should set alarm bells ringing are often ignored by doctors … New idioms dictionary
Set Dai De — was a Kiowa chief during the American Civil War. He used armed resistance against the American government, which was trying to force his people onto a reservation. He was brought before a general to answer for his actions. He took full… … Wikipedia
Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… … Wikipedia
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia