关于P不等于NP的一篇短文

Journal of Siberian Federal University. Mathematics and Physics Pub Date : 2021-04-01 DOI:10.17516/1997-1397-2021-14-2-258-260

V. Rybakov

{"title":"关于P不等于NP的一篇短文","authors":"V. Rybakov","doi":"10.17516/1997-1397-2021-14-2-258-260","DOIUrl":null,"url":null,"abstract":"We find a computational algorithmic task and prove that it is solvable in polynomial time by a non-deterministic Turing machine and cannot be solved in polynomial time by any deterministic Turing machine. The point is that our task does not look as very canonical one and if it may be classified as computational problem in standard terms","PeriodicalId":422202,"journal":{"name":"Journal of Siberian Federal University. Mathematics and Physics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Short Essay towards if P not equal NP\",\"authors\":\"V. Rybakov\",\"doi\":\"10.17516/1997-1397-2021-14-2-258-260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We find a computational algorithmic task and prove that it is solvable in polynomial time by a non-deterministic Turing machine and cannot be solved in polynomial time by any deterministic Turing machine. The point is that our task does not look as very canonical one and if it may be classified as computational problem in standard terms\",\"PeriodicalId\":422202,\"journal\":{\"name\":\"Journal of Siberian Federal University. Mathematics and Physics\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Siberian Federal University. Mathematics and Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17516/1997-1397-2021-14-2-258-260\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Siberian Federal University. Mathematics and Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17516/1997-1397-2021-14-2-258-260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们找到了一个计算算法任务，并证明了它可以用非确定性图灵机在多项式时间内解决，而不能用任何确定性图灵机在多项式时间内解决。关键是我们的任务看起来不是很规范，如果它可以被归类为标准的计算问题

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Short Essay towards if P not equal NP

We find a computational algorithmic task and prove that it is solvable in polynomial time by a non-deterministic Turing machine and cannot be solved in polynomial time by any deterministic Turing machine. The point is that our task does not look as very canonical one and if it may be classified as computational problem in standard terms

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Siberian Federal University. Mathematics and Physics

自引率

0.00%

发文量