AbstractKo proved that the P-selective sets are in the advice class P/quadratic, and Hemaspaandra, Naik, Ogihara, and Selman showed that they are in PP/linear. We strengthen the latter result by establishing that the P-selective sets are in NP/linear ∩ coNP/linear. We show linear advice to be optimal
This paper introduces a notion of p-best response set (p-BR). We build on this notion in order to pr...
The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic ...
This paper provides a tutorial overview of the advice complexity of the semifeasible sets—informally...
Ko [1983] proved that the P-selective sets are in the advice class P/quadratic. We prove that the P-...
AbstractKo proved that the P-selective sets are in the advice class P/quadratic, and Hemaspaandra, N...
Ko proved that the P-selective sets are in the advice class P/quadratic. Hemaspaandra et al. showed ...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
Karp and Lipton, in their seminal 1980 paper, introduced the notion of advice (nonuniform) complexit...
AbstractIt was known that every set A in P/poly has an advice function in PF(ΣP2(A)). This paper sho...
It was known that every set A in P/poly has an advice function in PF(¿P2(A)). This note shows that A...
AbstractKarp and Lipton (1980) introduced the notion of nonuniform complexity classes where a certai...
Karp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount o...
This paper introduces a notion of p-best response set (p-BR). We build on this notion in order to pr...
The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic ...
This paper provides a tutorial overview of the advice complexity of the semifeasible sets—informally...
Ko [1983] proved that the P-selective sets are in the advice class P/quadratic. We prove that the P-...
AbstractKo proved that the P-selective sets are in the advice class P/quadratic, and Hemaspaandra, N...
Ko proved that the P-selective sets are in the advice class P/quadratic. Hemaspaandra et al. showed ...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regard...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
Karp and Lipton, in their seminal 1980 paper, introduced the notion of advice (nonuniform) complexit...
AbstractIt was known that every set A in P/poly has an advice function in PF(ΣP2(A)). This paper sho...
It was known that every set A in P/poly has an advice function in PF(¿P2(A)). This note shows that A...
AbstractKarp and Lipton (1980) introduced the notion of nonuniform complexity classes where a certai...
Karp and Lipton [9] introduced the notion of non-uniform complexity classes where a certain amount o...
This paper introduces a notion of p-best response set (p-BR). We build on this notion in order to pr...
The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic ...
This paper provides a tutorial overview of the advice complexity of the semifeasible sets—informally...
DOI
Add to ORKG