The authors introduce P^NP-kernels, show they are equivalent to membership in FPT^NP, and provide a lower-bound framework plus applications to logic and graph problems.
Analogous to the case of kernels and fixed-parameter tractable problems, we get the following
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Kernelization with Access to NP-Oracles
The authors introduce P^NP-kernels, show they are equivalent to membership in FPT^NP, and provide a lower-bound framework plus applications to logic and graph problems.