A Characteristic of NP-complete
{"Image DocumentName": "A Characteristic of NP-complete", "Image ImageDescription": "Theorem. If B\u2208NPC and B\u2264PC for C\u2208NP, then C\u2208NPC. Is there a fundamental problem for the chain of polynomial time reducibility? P1\u2264PP2\u2264P \u2026 \u2264PPn\u2264P(?) Applied Algorithm Lab. KAIST.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}