More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
SIAM Journal on Computing
Planar graph coloring is not self-reducible, assuming P≠NP
Theoretical Computer Science
P-selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences
On the complexity of unique solutions
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Different Reducibility Notions for Function Classes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Computing From Partial Solutions
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Some Comments on Functional Self-Reducibility and the NP Hierarchy
Some Comments on Functional Self-Reducibility and the NP Hierarchy
Planar 3-colorability is polynomial complete
ACM SIGACT News
| Hi-index | 0.00 |
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism 驴 between two isomorphic graphs is as hard as computing 驴 itself.Th is result optimally improves upon a result of G谩l et al. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles.W e also show that computing the lexicographically first four-coloring for planar graphs is 驴2p-hard.Th is result optimally improves upon a result of Khuller and Vazirani who prove this problem to be NP-hard, and conclude that it is not self-reducible in the sense of Schnorr, assuming P 驴 NP. We discuss this application to non-self-reducibility and provide a general related result.