Planar graph coloring is not self-reducible, assuming P≠NP

Authors:
Samir Khuller;Vijay V. Vazirani
Affiliations:
Univ. of Maryland, College Park;Indian Institute of Technology, New Delhi, India
Venue:
Theoretical Computer Science
Year:
1991

Citing 0
Cited 3

Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P

Information Processing Letters
Enumerating all solutions of a boolean CSP by non-decreasing weight

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing

Quantified Score

Hi-index	5.23

Visualization

Abstract