|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6416
| Title: | On Non-Isomorphic NP Complete Sets |
| Authors: | Hartmanis, Juris |
| Keywords: | computer science
technical report |
| Issue Date: | Oct-1983 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-576 |
| Abstract: | In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity can be determined in polynomial-time then there exist NP complete sets that are not polynomial-time isomorphic. Keywords: NP complete sets, isomorphism, Kolmogorov complexity. |
| URI: | http://hdl.handle.net/1813/6416 |
| Appears in Collections: | Computer Science Technical Reports
Hartmanis, Juris
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
