Der
Der may refer to:
DER may be an acronym for:
Éder
Éder is a given name, may refer to:
Der (Sumer)
Coordinates: 33°7′25″N 45°55′53″E / 33.12361°N 45.93139°E / 33.12361; 45.93139
Der (Sumerian: ALUDi-e-ir) was a Sumerian city-state at the site of modern Tell Aqar near al-Badra in Iraq's Wasit Governorate. It was east of the Tigris River on the border between Sumer and Elam. Its name was possibly Durum.
History
Der was occupied from the Early Dynastic period through Neo-Assyrian times. The local deity of the city was named Ishtaran, represented on Earth by his minister, the snake god Nirah. In the late 3rd millennium, during the reign of Sulgi of the Third Dynasty of Ur, Der was mentioned twice. The Sulgi year name 11 was named "Year Ishtaran of Der was brought into his temple", and year 21 was named "Year Der was destroyed". In the second millennium, Der was mentioned in a tablet discovered at Mari sent by Yarim-Lim I of Yamhad; the tablet includes a reminder to Yasub-Yahad king of Der about the military help given to him for fifteen years by Yarim-Lim, followed by a declaration of war against the city in retaliation for what Yarim-Lim described as evil deeds committed by Yasub-Yahad.
PCP
PCP may refer to:
Computing
Medicine and pharmaceutics
Politics
Probabilistically checkable proof
In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking procedure deterministically reads the whole proof, always accepts correct proofs and rejects incorrect proofs. However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.
Probabilistically checkable proofs give rise to many complexity classes depending on the number of queries required and the amount of randomness used. The class PCP[r(n),q(n)] refers to the set of decision problems that have probabilistically checkable proofs that can be verified in polynomial time using at most r(n) random bits and by reading at most q(n) bits of the proof. Unless specified otherwise, correct proofs should always be accepted, and incorrect proofs should be rejected with probability greater than 1/2. The PCP theorem, a major result in computational complexity theory, states that PCP[O(log n),O(1)] = NP.
Peruvian Communist Party
The Peruvian Communist Party (in Spanish: Partido Comunista Peruano) is a communist party in Peru. It was founded in 1928 by José Carlos Mariátegui, under the name Partido Socialista del Perú (Socialist Party of Peru). In 1930 the name was changed to PCP. PCP is often identified as PCP [Unidad], to separate it from the Communist Party of Peru.
Jorge Del Prado was the general secretary between 1966 and 1991. In 1980 the PCP and other left-wing groups formed the United Left.
The main political base of the PCP is currently located at Plaza Ramón Castilla, Lima and is led by Roberto De La Cruz Huama. PCP publishes Unidad (Unity) and Nuestra Bandera (Our Flag).
In the 2011 general election the party took part in the successful Peru Wins alliance of Ollanta Humala.
See also
External links
Podcasts:
