-
1 Probabilistically Checkable Proof
Mathematics: PCPУниверсальный русско-английский словарь > Probabilistically Checkable Proof
-
2 PCP
1) Общая лексика: hum. сокр. Planar Cell Polarity, фенилциклидин ("анг (наркотик, получаемый из транквилизатора для животных, появившийся в начале 1970-х и распространённый преимущественно в США, обладает галлюциногенным эффектом, нарушает координацию движений и мысли)2) Компьютерная техника: Program Control Program3) Медицина: терапевт, плазмоклеточная пневмония4) Американизм: Personal Contract Purchase, Purchasing Card Purchase5) Военный термин: Portable Communications Pack, Project Concept Proposal, patient collecting point, pilot control panel, planar combat problem, platoon command post, portable code processor, preliminary cost proposal, product change proposal, program change proposal, program control plan, programmable communications processor, project change proposal, prototype communications processor6) Техника: optron, post-construction permit, primary coolant pump, process control program, program control procedure7) Шутливое выражение: Perforated Cerebral Party, Pils Club Pulverizer, Professional To Cheesy Pedal8) Химия: Phenyl Cycli Piperidine, пентахлорофенол (pentachlorophenol), pentachlorinated phenol9) Математика: Probabilistically Checkable Proof, проблема соответствия Поста (Post correspondence problem)10) Религия: Preserving Christian Publications11) Бухгалтерия: Prepaid Capitation Plan12) Страхование: врач первичной медицинской помощи (primary care physician)13) Грубое выражение: Pretty Crappy Policing14) Оптика: plastic-clad plastic15) Телекоммуникации: Packet Chain Protocol16) Сокращение: Personnel Control Point, Phencyclidine, phencyclidine pill, Pneumocystis carinii pneumonia, posted contract price, справочная контрактная цена17) Физиология: Personal Care Physician, Primary Care Physician, Phencyclidine (Angel Dust - illegal street drug)18) Электроника: Programmable Communication Processors19) Сленг: патентованное ветеринарное средство, используется молодёжью в качестве наркотика, фенциклидин, наркотик фенциклидин20) Вычислительная техника: Printer Control Protocol, Primary Control Program (IBM, OS, OS/PCP)21) Нефть: progressive cavity pump22) Пищевая промышленность: Portion Control Pack23) Фирменный знак: Paper City Pub, Planet Core Productions, Professional Computer Printing24) Экология: pentachlorophenol25) Деловая лексика: Person Centered Plan, Person Centered Planning26) Глоссарий компании Сахалин Энерджи: Pipe Coating Plant, Project Change Panel27) Сетевые технологии: Priority Ceiling Protocol, primary control program, главная управляющая программа, первичная управляющая программа28) Полимеры: polychloroprene, пористый координационный полимер, металлоорганическая каркасная структура, MOF29) Пластмассы: Post- Consumer Plastic, Principal Certification Pattern30) Сахалин Р: Process Control Panel31) Химическое оружие: Pavlograd Chemical Plant, Portable control panel32) Физическая химия: metal-organic framework, porous coordination polymer33) Макаров: photon-coupled pair34) Расширение файла: PCP file Bitmap graphics, Programmable Communication Processor35) Наркотики: "диссоциативы" (сленг наркоманов), Cigarrode cristal (сленговое название наркотика), Диссоциативный анестетик, фенил циклогексил пиперидин (phenylcyclohexylpiperidine), (фенциклидин) ангельская пыль36) Нефть и газ: precast concrete pad, винтовой насос кавитационного типа37) Газоперерабатывающие заводы: power control panel38) Фантастика Planetary Council Protectorate39) Должность: Primary Care Provider41) Аэропорты: Principe Island, Principe Island
См. также в других словарях:
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… … Wikipedia
probabilistically checkable proof — noun A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm … Wiktionary
Interactive proof system — In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
NEXPTIME — In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non deterministic Turing machine using time O(2p(n)) for some polynomial p(n), and unlimited space.… … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
PCP (complexity) — In computational complexity theory, PCP is the class of decision problems having probabilistically checkable proof systems. Introduction and definition In complexity theory, a PCP system can be viewed as an interactive proof system in which the… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Madhu Sudan — ( ta. மதுசூதன்) (born September 12, 1966) is an Indian computer scientist, professor of computer science at the Massachusetts Institute of Technology (MIT) and a member of MIT Computer Science and Artificial Intelligence Laboratory.He was awarded … Wikipedia
Arthur–Merlin protocol — In computational complexity theory, an Arthur–Merlin protocol is an interactive proof system in which the verifier s coin tosses are constrained to be public (i.e. known to the prover too). This notion was introduced by Babai (1985). Goldwasser… … Wikipedia
(SAT, ε-UNSAT) — In computational complexity theory, (SAT, ε UNSAT) is a language that is used in the proof of the PCP theorem, which relates the language NP to probabilistically checkable proof systems.For a given 3 CNF formula, Φ, and a constant, ε < 1, Φ is in … Wikipedia