Results 211 to 220 of about 54,899 (262)
Some of the next articles are maybe not open access.
2008
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with very low communication complexity, then for some NP languages, one can construct PCPs that are significantly shorter than the known PCPs (without the additional interactive ...
Yael Tauman Kalai, Ran Raz
openaire +2 more sources
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with very low communication complexity, then for some NP languages, one can construct PCPs that are significantly shorter than the known PCPs (without the additional interactive ...
Yael Tauman Kalai, Ran Raz
openaire +2 more sources
Journal of Cryptology, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
History and Pharmacology of PCP and PCP-Related Analogs
Journal of Psychedelic Drugs, 1980(1980). History and Pharmacology of PCP and PCP-Related Analogs. Journal of Psychedelic Drugs: Vol. 12, PCP: Problems and Prevention. Selected Proceedings of the National PCP Conference 1979+K2, pp. 223-227.
openaire +2 more sources
Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is on the case when it is enough for the verifier to know that the answer is close to correct.
Funda Ergün +2 more
openaire +1 more source
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is on the case when it is enough for the verifier to know that the answer is close to correct.
Funda Ergün +2 more
openaire +1 more source
Chest, 1989
The most frequent radiographic presentation of (PCP) is bilateral interstitial or alveolar infiltrates. Atypical features include lobar distribution, pleural effusions, hilar adenopathy, cyst formation and spontaneous pneumothorax. A diffuse miliary pattern has not been described previously for PCP. A 30-year-old male intravenous drug abuser, with AIDS,
L S, Wasser, E, Brown, W, Talavera
openaire +2 more sources
The most frequent radiographic presentation of (PCP) is bilateral interstitial or alveolar infiltrates. Atypical features include lobar distribution, pleural effusions, hilar adenopathy, cyst formation and spontaneous pneumothorax. A diffuse miliary pattern has not been described previously for PCP. A 30-year-old male intravenous drug abuser, with AIDS,
L S, Wasser, E, Brown, W, Talavera
openaire +2 more sources
PCP (Phencyclidine): An Update
Journal of Psychedelic Drugs, 1979The steady rise in the promiscuous use of phencyclidine (PCP) as a "recreational" drug has recently gained nationwide attention because of the numerous violent and/or bizarre incidents caused by the use of this drug. Because the media often exaggerate reports of bizarre and violent behavior to make a "good" story, the potential PCP user may be tempted ...
openaire +2 more sources
1998
In this section, we give an outline of the proof of the PCP-Theorem, which states that NP=PCP(logn,1). The key idea for reducing the number of random bits, which also implies a reduction of the length of the proof, is a more concise encoding of an assignment. Instead of linear functions we use multivariate polynomials of low degree as an encoding.
Volker Heun +2 more
openaire +1 more source
In this section, we give an outline of the proof of the PCP-Theorem, which states that NP=PCP(logn,1). The key idea for reducing the number of random bits, which also implies a reduction of the length of the proof, is a more concise encoding of an assignment. Instead of linear functions we use multivariate polynomials of low degree as an encoding.
Volker Heun +2 more
openaire +1 more source
Cancer survivorship for the PCP
Current Problems in Pediatric and Adolescent Health CareThe number of childhood cancer survivors (CCS) in the United States exceeds 500,000 and continues to rise1. While recurrence risk diminishes over time, the prevalence of late effects from cancer treatment increases with age and affects over 60% of survivors2-3. Primary care providers (PCPs) are ideally positioned to manage the long-term health needs of
Sharon L, Conner, Wilson, File
openaire +2 more sources
XRDS: Crossroads, The ACM Magazine for Students, 2012
How the search for the limits of computing led to the discovery of the unexpected power of proofs.
openaire +1 more source
How the search for the limits of computing led to the discovery of the unexpected power of proofs.
openaire +1 more source