PCP

PCP may refer to:

Computing

  • Performance Co-Pilot, an open-source performance monitoring system
  • Port Control Protocol, a computer networking protocol allowing hosts to create explicit port forwarding rules on default gateways
  • Priority ceiling protocol, a computer science concept
  • Priority Code Point, a three-bit priority field within an Ethernet frame header when using IEEE 802.1q tagged frames
  • Puppet Certified Professional, someone who has passed the certification exam, proving proficiency in using Puppet
  • Medicine and pharmaceutics

  • Phencyclidine, a dissociative drug
  • Primary care physician, a doctor who acts as first point of consultation for patients
  • Primary care paramedic, the entry-level of paramedic practice in Canada
  • Pneumocystis pneumonia, a form of pneumonia caused by the yeast-like fungus
  • Post-coital pill, a form of emergency contraception
  • Pharmacy Council of Pakistan
  • Politics

  • Paraguayan Communist Party
  • Partido Comunista del Peru, also known as Shining Path
  • Personal Choice Party, Utah
  • 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

  • Communism in Peru
  • External links

  • PCP website
  • Nuestra Bandera
  • Podcasts:

    PLAYLIST TIME:
    ×