发布求助
文献互助 智能选刊 最新文献

ACM SIGACT News最新文献

筛选
英文 中文
The Complexity of the Shortest Vector Problem 最短向量问题的复杂性
ACM SIGACT News Pub Date : 2023-02-28 DOI: 10.1145/3586165.3586172
Huck Bennett
{"title":"The Complexity of the Shortest Vector Problem","authors":"Huck Bennett","doi":"10.1145/3586165.3586172","DOIUrl":"https://doi.org/10.1145/3586165.3586172","url":null,"abstract":"Computational problems on point lattices play a central role in many areas of computer science including integer programming, coding theory, cryptanalysis, and especially the design of secure cryptosystems. In this survey, we present known results and open questions related to the complexity of the most important of these problems, the Shortest Vector Problem (SVP).","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122565548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
REMEMBERING JURIS 记住法学博士
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577978
János Simon
{"title":"REMEMBERING JURIS","authors":"János Simon","doi":"10.1145/3577971.3577978","DOIUrl":"https://doi.org/10.1145/3577971.3577978","url":null,"abstract":"Juris was a great scientist, teacher, advisor, builder of institutions, and an overall wonderful human being-a mensch. I had the privilege of being his advisee, and having a benefit of his friendship, his mentoring, and his support throughout my academic life. He had a profound influence on my taste in research, on my career, and on my life.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130870319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reminiscences of Juris 法学回忆
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577976
Dexter Kozen
{"title":"Reminiscences of Juris","authors":"Dexter Kozen","doi":"10.1145/3577971.3577976","DOIUrl":"https://doi.org/10.1145/3577971.3577976","url":null,"abstract":"I was fortunate to have been a student of Juris Hartmanis during the early years of the Computer Science Department at Cornell. Juris was a founding member of the department and its first chair.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121123310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Book Review Column 书评专栏
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577973
Frederic Green
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3577971.3577973","DOIUrl":"https://doi.org/10.1145/3577971.3577973","url":null,"abstract":"Sadly, I never had a chance to really get to know Juris Hartmanis. However, at the time that I was still wondering what avenues to pursue in computer science, his work was one of my principal motivations. His talks, several of which I remember attending back in the 1980s, were crystal clear, entertaining, and inspiring. As much as he will be missed, he lives on through his legacy, as manifested in his work as well as his many eminent students.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128199129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SIGACT News Complexity Theory Column 115 SIGACT新闻复杂性理论专栏
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577977
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 115","authors":"L. Hemaspaandra","doi":"10.1145/3577971.3577977","DOIUrl":"https://doi.org/10.1145/3577971.3577977","url":null,"abstract":"Juris Hartmanis was so preternaturally wise and brilliant that in time people may find it hard to believe that someone so extraordinary existed in this world. Yet as I write this, three months to the day after Juris passed away, it still seems impossible that such a force of nature can no longer be part of this world.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Open Problems Column 开放性问题专栏
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577975
W. Gasarch
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3577971.3577975","DOIUrl":"https://doi.org/10.1145/3577971.3577975","url":null,"abstract":"Juris Hartmanis, one of the founders of modern complexity theory, passed away on July 29, 2022 at the age of 94. This column is a tribute to him. It is Open Problems by or Inspired by Juris Hartmanis","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127183498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Review of Feasible Computations and Provable Complexity Properties by Juris Hartmanis Juris Hartmanis对可行计算和可证明复杂性性质的评述
ACM SIGACT News Pub Date : 2022-12-19 DOI: 10.1145/3577971.3577974
Frederic Green
{"title":"Review of Feasible Computations and Provable Complexity Properties by Juris Hartmanis","authors":"Frederic Green","doi":"10.1145/3577971.3577974","DOIUrl":"https://doi.org/10.1145/3577971.3577974","url":null,"abstract":"\"It may only be a slight exaggeration to claim that in the 1930s we started to understand what is and is not effectively computable and that in the 1970s we started to understand what is and is not practically or feasibly computable. There is no doubt that the results about what can and cannot be effectively computed or formalized in mathematics have had a profound influence on mathematics, and, even more broadly, they have influenced our view of our scientific methods. We believe that the results about what can and cannot be practically computed will also have a major influence on computer science, mathematics, and even though more slowly, will affect other research areas and influence how we think about scientific theories.\" - Juris Hartmanis (from the Introduction)","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125717525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Guest column: A panorama of counting problems the decision version of which is in P3 客座专栏:计算问题的全景图，其决策版本在P3中
ACM SIGACT News Pub Date : 2022-08-30 DOI: 10.1145/3561064.3561072
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, S. Zachos
{"title":"Guest column: A panorama of counting problems the decision version of which is in P3","authors":"Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, S. Zachos","doi":"10.1145/3561064.3561072","DOIUrl":"https://doi.org/10.1145/3561064.3561072","url":null,"abstract":"Since Valiant's seminal work, where the complexity class #P was defined, much research has been done on counting complexity, from various perspectives. A question that permeates many of these efforts concerns the approximability of counting problems, in particular which of them admit an efficient approximation scheme (fpras). A counting problem (a function from Σ* to N) that admits an fpras must necessarily have an easy way to decide whether the output value is nonzero. Having this in mind, we focus our attention on classes of counting problems, the decision version of which is in P (or in RP). We discuss structural characterizations for classes of such problems under various lenses: Cook and Karp reductions, path counting in non-deterministic Turing machines, approximability and approximation-preserving reductions, easy decision by randomization, descriptive complexity, and interval-size functions. We end up with a rich landscape inside #P, revealing a number of inclusions and separations among complexity classes of easy-to-decide counting problems.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130749266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SIGACT news complexity theory column 114 SIGACT新闻复杂性理论专栏
ACM SIGACT News Pub Date : 2022-08-30 DOI: 10.1145/3561064.3561071
L. Hemaspaandra
{"title":"SIGACT news complexity theory column 114","authors":"L. Hemaspaandra","doi":"10.1145/3561064.3561071","DOIUrl":"https://doi.org/10.1145/3561064.3561071","url":null,"abstract":"This issue's column (which comes immediately after some memories of and comments on Juris Hartmanis, who passed away a few days ago), by Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, and Stathis Zachos, is a tour---A Panorama of Counting Problems the Decision Version of which is in P---of the exciting world of counting functions whose decision version (the set of inputs on which the function evaluates to zero) is in P.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123966395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The book review column 书评专栏
ACM SIGACT News Pub Date : 2022-08-30 DOI: 10.1145/3561064.3561065
Frederic Green
{"title":"The book review column","authors":"Frederic Green","doi":"10.1145/3561064.3561065","DOIUrl":"https://doi.org/10.1145/3561064.3561065","url":null,"abstract":"My predecessor as book review editor, Bill Gasarch, held the post for 17 years. In his final column in January 2015, he said that that's longer than anyone should have the job. I count myself as lucky to have been nominated as his successor. At the time, Bill advised me not to stay on for more than 5 years. Well, here it is 6.5 years out and some 26 columns later, so it is high time for me to retire from the position.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124041970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信