Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$

Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$

File(s)
89-1064.ps (172.48 KB)
89-1064.pdf (539.34 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6864
Collections
Computer Science Technical Reports
Author
Khuller, Samir
Vazirani, Vijay V.
Abstract

No abstract is available.

Date Issued
1989-12
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1064
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance