关于P与NP的Clay千年问题的最简单可能的完全正确解。P≠NP = EXPTIME的一个简单证明

{"title":"关于P与NP的Clay千年问题的最简单可能的完全正确解。P≠NP = EXPTIME的一个简单证明","authors":"K. Kyritsis","doi":"10.4236/jcc.2023.118013","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":67799,"journal":{"name":"电脑和通信(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Simplest Possible Fully Correct Solution of the Clay Millennium Problem about P vs. NP. A Simple Proof That P ≠ NP = EXPTIME\",\"authors\":\"K. Kyritsis\",\"doi\":\"10.4236/jcc.2023.118013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":67799,\"journal\":{\"name\":\"电脑和通信(英文)\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"电脑和通信(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/jcc.2023.118013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"电脑和通信(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/jcc.2023.118013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}