Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$
| dc.contributor.author | Khuller, Samir | en_US |
| dc.contributor.author | Vazirani, Vijay V. | en_US |
| dc.date.accessioned | 2007-04-23T17:40:22Z | |
| dc.date.available | 2007-04-23T17:40:22Z | |
| dc.date.issued | 1989-12 | en_US |
| dc.description.abstract | No abstract is available. | en_US |
| dc.format.extent | 552280 bytes | |
| dc.format.extent | 176616 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1064 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6864 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Planar Graph Coloring is Not Self-Reducible Assuming $P \neq NP$ | en_US |
| dc.type | technical report | en_US |