开放性问题专栏

W. Gasarch
{"title":"开放性问题专栏","authors":"W. Gasarch","doi":"10.1145/3232679.3232686","DOIUrl":null,"url":null,"abstract":"There have been two polls asking theorists (and others) what they thought of P vs NP (and other questions) [4, 5]. Both were written by William Gasarch and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra. They were in 2002 and 2012. Since William Gasarch is fond of Van der Waerden's theorem, you would think the next poll would be 2022; however, Lane asked if it could be a bit earlier so as to be the 100th issue of his column. So here we are. In the past the questions for the poll appeared in Lane's column. This time they appear here in the Open Problems Column, which makes sense since, well, P vs NP is indeed an open problem.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Open Problems Column\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1145/3232679.3232686\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There have been two polls asking theorists (and others) what they thought of P vs NP (and other questions) [4, 5]. Both were written by William Gasarch and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra. They were in 2002 and 2012. Since William Gasarch is fond of Van der Waerden's theorem, you would think the next poll would be 2022; however, Lane asked if it could be a bit earlier so as to be the 100th issue of his column. So here we are. In the past the questions for the poll appeared in Lane's column. This time they appear here in the Open Problems Column, which makes sense since, well, P vs NP is indeed an open problem.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3232679.3232686\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3232679.3232686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

有两个民意调查询问理论家(和其他人)他们对P vs NP(以及其他问题)的看法[4,5]。这两篇文章都是由William Gasarch撰写的,发表在SIGACT News的复杂性专栏上,由Lane A. Hemaspaandra编辑。分别是2002年和2012年。既然威廉·加萨奇(William Gasarch)喜欢范德华登定理(Van der Waerden’s theorem),你可能会认为下一次投票将在2022年;然而,莱恩问他是否可以早一点,这样他的专栏就可以第100期了。所以我们在这里。过去,民意调查的问题出现在莱恩的专栏中。这次它们出现在开放问题专栏中,这是有意义的,因为P对NP确实是一个开放问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Open Problems Column
There have been two polls asking theorists (and others) what they thought of P vs NP (and other questions) [4, 5]. Both were written by William Gasarch and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra. They were in 2002 and 2012. Since William Gasarch is fond of Van der Waerden's theorem, you would think the next poll would be 2022; however, Lane asked if it could be a bit earlier so as to be the 100th issue of his column. So here we are. In the past the questions for the poll appeared in Lane's column. This time they appear here in the Open Problems Column, which makes sense since, well, P vs NP is indeed an open problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Technical Report Column Open Problems Column Distributed Computing Column 87 Recent Advances in Multi-Pass Graph Streaming Lower Bounds The Book Review Column Recent Advances in Multi-Pass Graph Streaming Lower Bounds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1