On the power of deterministic reductions to C=P
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/330917
Tipus de documentReport de recerca
Data publicació1991-05
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The counting class C=P, which captures the notion of "exact counting", while extremely powerful under various nondeterministic reductions, is quite weak under polynomial-time deterministic reductions. We discuss the analogies between NP and co-C=P, which allow us to derive many interesting results for such deterministic reductions to co-C=P. We exploit these results to obtain some interesting oracle separations. Most importantly, we show that there exists an oracle A such that P [superA] P [super C=P super A] and BPP [super A] P [super C=P super A]. From this we can conclude that techniques that would prove that C=P and PP are polynomial-time Turing equivalent would not relativize.
CitacióGreen, F. On the power of deterministic reductions to C=P. 1991.
Forma partLSI-91-17
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1400012819.pdf | 947,4Kb | Visualitza/Obre |