12 relations: ATC code P, EQP (complexity), P-adic number, Qatar Petroleum, Qp ligature, Qp-Crazy, Quadratic programming, Qualified person (European Union), Quantitative parasitology, Quarter Pounder, Quoted-printable, Time complexity.
New!!: QP and ATC code P ·
In computational complexity theory, EQP (sometimes called QP), which stands for exact quantum polynomial time, is the class of decision problems solvable by a quantum computer which outputs the correct answer with probability 1 and runs in polynomial time.
New!!: QP and EQP (complexity) ·
In mathematics the -adic number system for any prime number extends the ordinary arithmetic of the rational numbers in a way different from the extension of the rational number system to the real and complex number systems.
New!!: QP and P-adic number ·
Qatar Petroleum (QP) is a state owned petroleum company in Qatar.
New!!: QP and Qatar Petroleum ·
The qp ligature,, is a typographic ligature of Latin q and p (also interpretable as a ligature of c and p), and is used in some phonetic transcription systems, particularly for African languages, to represent a voiceless labiodental plosive.
New!!: QP and Qp ligature ·
Qp-Crazy is a Japanese hardcore punk band.
New!!: QP and Qp-Crazy ·
Quadratic programming (QP) is a special type of mathematical optimization problem.
New!!: QP and Quadratic programming ·
Qualified person (QP) is a technical term used in European Union pharmaceutical regulation (Directive 2001/83/EC for Medicinal products for human use).
Quantifying parasites in a sample of hosts or comparing measures of infection across two or more samples can be challenging.
New!!: QP and Quantitative parasitology ·
The Quarter Pounder is a hamburger product sold by international fast food chain McDonald's, so named for containing a patty with a precooked weight of a quarter of a pound (113.4 g).
New!!: QP and Quarter Pounder ·
Quoted-Printable, or QP encoding, is an encoding using printable ASCII characters (alphanumeric and the equals sign ".
New!!: QP and Quoted-printable ·
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input.
New!!: QP and Time complexity ·