嘉宾专栏:第三个P=?NP调查

W. Gasarch
{"title":"嘉宾专栏:第三个P=?NP调查","authors":"W. Gasarch","doi":"10.1145/3319627.3319636","DOIUrl":null,"url":null,"abstract":"In 2001 I (innocently!) asked Lane if I could write an article for his SIGACT News Complexity Theory Column that would be a poll of what computer scientists (and others) thought about P=?NP and related issues. It was to be an objective record of subjective opinions. I asked (by telegraph in those days) over 100 theorists. Exactly 100 responded, which made taking percentages very easy. That poll appeared in the SIGACT News Complexity Theory Column in 2002 (I call it the 2002 poll even though people answered it in 2001). The Wikipedia page on P=?NP links to it. That poll's readership and popularity have exceeded my wildest dreams.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Guest Column: The Third P=?NP Poll\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1145/3319627.3319636\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 2001 I (innocently!) asked Lane if I could write an article for his SIGACT News Complexity Theory Column that would be a poll of what computer scientists (and others) thought about P=?NP and related issues. It was to be an objective record of subjective opinions. I asked (by telegraph in those days) over 100 theorists. Exactly 100 responded, which made taking percentages very easy. That poll appeared in the SIGACT News Complexity Theory Column in 2002 (I call it the 2002 poll even though people answered it in 2001). The Wikipedia page on P=?NP links to it. That poll's readership and popularity have exceeded my wildest dreams.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3319627.3319636\",\"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/3319627.3319636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

2001年,我(天真地)问Lane是否可以为他的SIGACT新闻复杂性理论专栏写一篇文章,就计算机科学家(和其他人)对P=?NP及相关问题。它是主观意见的客观记录。我(当时通过电报)询问了100多位理论家。正好有100人回答,这使得计算百分比变得非常容易。这项民意调查出现在2002年的SIGACT新闻复杂性理论专栏(我称之为2002年的民意调查,尽管人们在2001年回答了这个问题)。维基百科关于P=?NP链接到它。那份民意调查的读者群和受欢迎程度超出了我的想象。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Guest Column: The Third P=?NP Poll
In 2001 I (innocently!) asked Lane if I could write an article for his SIGACT News Complexity Theory Column that would be a poll of what computer scientists (and others) thought about P=?NP and related issues. It was to be an objective record of subjective opinions. I asked (by telegraph in those days) over 100 theorists. Exactly 100 responded, which made taking percentages very easy. That poll appeared in the SIGACT News Complexity Theory Column in 2002 (I call it the 2002 poll even though people answered it in 2001). The Wikipedia page on P=?NP links to it. That poll's readership and popularity have exceeded my wildest dreams.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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