32-letter words containing m, a, l, d, p, t
- applications development manager — (job) (Or "Director") The person in a company who plans and oversees multiple projects and project managers. The Applications Development Managers works with the CIO and senior management to determine systems development strategy and standards. He or she administers department budget and reviews project managers.
- azimuthal equidistant projection — a projection in which the shortest distance between any point and a central point is a straight line, such a line representing a great circle through the central point.
- democratic-republic-of-the-congo — People's Republic of the, a republic in central Africa, W of the Democratic Republic of the Congo: formerly an overseas territory in French Equatorial Africa; now an independent member of the French Community. 132,046 sq. mi. (341,999 sq. km). Capital: Brazzaville. Formerly French Congo, Middle Congo.
- lymphadenopathy-associated virus — See under AIDS virus. Abbreviation: LAV.
- lymphokine-activated killer cell — LAK cell.
- nondeterministic polynomial time — (complexity) (NP) A set or property of computational decision problems solvable by a nondeterministic Turing Machine in a number of steps that is a polynomial function of the size of the input. The word "nondeterministic" suggests a method of generating potential solutions using some form of nondeterminism or "trial and error". This may take exponential time as long as a potential solution can be verified in polynomial time. NP is obviously a superset of P (polynomial time problems solvable by a deterministic Turing Machine in polynomial time) since a deterministic algorithm can be considered as a degenerate form of nondeterministic algorithm. The question then arises: is NP equal to P? I.e. can every problem in NP actually be solved in polynomial time? Everyone's first guess is "no", but no one has managed to prove this; and some very clever people think the answer is "yes". If a problem A is in NP and a polynomial time algorithm for A could also be used to solve problem B in polynomial time, then B is also in NP. See also Co-NP, NP-complete.
- pleuk grammar development system — (grammar, tool) A shell for grammar development by Jo Calder <[email protected]>, Kevin Humphreys <[email protected]>, Chris Brew <[email protected]>, and Mike Reape <[email protected]>. It handles various grammatical formalisms and requires SICStus Prolog version 2.1#6 or later. E-mail: <[email protected]>.
- probability of failure on demand — (systems) (POFOD) The likelihood that some system will fail when a service request is made.
- single instruction multiple data — Single Instruction/Multiple Data
- telecommunication display device — Telecommunications Device for the Deaf
- temporomandibular joint disorder — a syndrome caused by a dislocation, injury, etc. of the temporomandibular joint, characterized variously by headache, facial pain, dizziness, partial loss of hearing, etc.
- temporomandibular joint syndrome — a condition attributed to tension in or faulty articulation of the temporomandibular joint, having a wide range of symptoms that include dizziness, ringing in the ears, and pain in the head, neck, and shoulders.
- to leave somebody partially deaf — to make sb partly deaf
- united states employment service — the division of the Department of Labor that supervises and coordinates the activities of state employment agencies. Abbreviation: USES.
On this page, we collect all 32-letter words with M-A-L-D-P-T. It’s easy to find right word with a certain length. It is the easiest way to find 32-letter word that contains in M-A-L-D-P-T to use in Scrabble or Crossword puzzles