To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.
{"title":"SIGACT News Complexity Theory Column 99","authors":"L. Hemaspaandra","doi":"10.1145/3289137.3289147","DOIUrl":"https://doi.org/10.1145/3289137.3289147","url":null,"abstract":"To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"4 1","pages":"48-50"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82271824","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}
The power of randomization in the computational context is one of the fundamental discoveries of computer science; furthermore, statistical and probabilistic reasoning is indispensable for modern-day data analysis and data science. In this significantly-expanded second edition, the authors (continuing to assume exposure to just basic discrete probability) present a unified treatment of probabilistic concepts useful for modern computer science and data science.
{"title":"Probability and Computing","authors":"A. Srinivasan","doi":"10.1145/3289137.3289142","DOIUrl":"https://doi.org/10.1145/3289137.3289142","url":null,"abstract":"The power of randomization in the computational context is one of the fundamental discoveries of computer science; furthermore, statistical and probabilistic reasoning is indispensable for modern-day data analysis and data science. In this significantly-expanded second edition, the authors (continuing to assume exposure to just basic discrete probability) present a unified treatment of probabilistic concepts useful for modern computer science and data science.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"3 1","pages":"20-22"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84286279","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}
Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3289137.3289143","DOIUrl":"https://doi.org/10.1145/3289137.3289143","url":null,"abstract":"Welcome to the Technical Reports Column. If your institution publishes technical reports that you'd like to have included here, please contact me at the email address above.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"20 1","pages":"23-33"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88321834","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}
This issue's Open Problem Column is by Stephen Fenner, Fred Green, and Steven Homer. It is titled: Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. It is not on xedparameter tractability. It is on a generalization of the geometric notion of convexity.
本期开放问题专栏由Stephen Fenner, Fred Green和Steven Homer撰写。它的题目是:固定参数外推和非周期顺序:开放问题。它不是关于xedparameter的可追溯性。它是对几何凸性概念的推广。
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3289137.3289144","DOIUrl":"https://doi.org/10.1145/3289137.3289144","url":null,"abstract":"This issue's Open Problem Column is by Stephen Fenner, Fred Green, and Steven Homer. It is titled: Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. It is not on xedparameter tractability. It is on a generalization of the geometric notion of convexity.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"13 1","pages":"34"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78808297","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}
The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying "we omit the low-level details of representation", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.
{"title":"Review of Compact Data Structures - a practical approach by Gonzalo Navarro","authors":"L. Kozma","doi":"10.1145/3289137.3289140","DOIUrl":"https://doi.org/10.1145/3289137.3289140","url":null,"abstract":"The book studies fundamental data structures and representations of combinatorial objects, including arrays, bitvectors, permutations, trees, graphs, etc. There are, of course, a great number of existing textbooks and lecture notes about data structures. The perspective of this book is, however, different from the usual presentations. In some sense, this book starts exactly where others leave off saying \"we omit the low-level details of representation\", and concerns itself mostly with the low-level representation. Specifically, it looks at how to organize and store data structures using as little space as possible while supporting efficient queries and operations. For the considered structures, the book explores the trade-off between reduced space and speed of operation. The analyses of the presented solutions go beyond the usual asymptotics, and also consider exact constant factors (particularly for the leading term of the space complexity); useful practical considerations are also discussed.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"9 1","pages":"9-13"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84780428","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}
In this column we review these three books: 1. Compact Data Structures - A Practical Approach, by Gonzalo Navarro. An unusual approach focussing on data structures that use as little space as is theoretically possible, while maintaining practicality. Review by Laszlo Kozma. 2. Power Up: Unlocking the Hidden Mathematics in Video Games, by Matthew Lane. A revealing look at the mathematics, physics, and computer science that underlies (good) video games, with special attention to their potential valuable role in education. Review by S. V. Nagaraj. 3. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (Second Edition), by Michael Mitzenmacher and Eli Upfal. The second edition2 of a distinguished text on a rich area that is central to computer and data science. Review by Aravind Srinivasan. Many thanks to these and all reviewers over the years who have graciously volunteered this valuable service to the community! Interested in reviewing? I hope so. Remember the perks: Learning (more?) about a field that interests you, a review on these pages, and a free book! The books listed on the next two pages are available, but the list is not exhaustive: I'm open to suggestions.
在本专栏中，我们将回顾这三本书:紧凑的数据结构——一个实用的方法，作者:Gonzalo Navarro。一种不寻常的方法，专注于数据结构，在理论上尽可能少地使用空间，同时保持实用性。Laszlo Kozma评论。《Power Up:解锁电子游戏中的隐藏数学》作者:Matthew Lane揭示了电子游戏背后的数学、物理和计算机科学，并特别关注了它们在教育中的潜在价值。S. V. Nagaraj评论。《概率和计算:算法和数据分析中的随机化和概率技术》(第二版)，作者:Michael Mitzenmacher和Eli Upfal。关于计算机和数据科学中心的丰富领域的杰出文本的第二版。Aravind Srinivasan评论。非常感谢这些人和所有多年来慷慨地自愿为社区提供宝贵服务的评论者!有兴趣回顾一下吗?我希望如此。记住这些福利:学习(更多?)你感兴趣的领域，在这些页面上发表评论，还有一本免费的书!下面两页列出的书都可以买到，但这个清单并不详尽:我愿意听取建议。
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3289137.3289139","DOIUrl":"https://doi.org/10.1145/3289137.3289139","url":null,"abstract":"In this column we review these three books: 1. Compact Data Structures - A Practical Approach, by Gonzalo Navarro. An unusual approach focussing on data structures that use as little space as is theoretically possible, while maintaining practicality. Review by Laszlo Kozma. 2. Power Up: Unlocking the Hidden Mathematics in Video Games, by Matthew Lane. A revealing look at the mathematics, physics, and computer science that underlies (good) video games, with special attention to their potential valuable role in education. Review by S. V. Nagaraj. 3. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis (Second Edition), by Michael Mitzenmacher and Eli Upfal. The second edition2 of a distinguished text on a rich area that is central to computer and data science. Review by Aravind Srinivasan. Many thanks to these and all reviewers over the years who have graciously volunteered this valuable service to the community! Interested in reviewing? I hope so. Remember the perks: Learning (more?) about a field that interests you, a review on these pages, and a free book! The books listed on the next two pages are available, but the list is not exhaustive: I'm open to suggestions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"82 1","pages":"6-8"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83776488","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}
Population protocols are a popular model of distributed computing, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the model has proved a useful abstraction for modeling various settings, from wireless sensor networks [35, 26], to gene regulatory networks [17], and chemical reaction networks [21]. In a nutshell, a population protocol consists of n agents with limited local state that interact randomly in pairs, according to an underlying communication graph, and cooperate to collectively compute global predicates. From a theoretical prospective, population protocols, with the restricted communication and computational power, are probably one of the simplest distributed model one can imagine. Perhaps surprisingly though, solutions to many classical distributed tasks are still possible. Moreover, these solutions often rely on interesting algorithmic ideas for design and interesting probabilistic techniques for analysis, while known lower bound results revolve around complex combinatorial arguments.
{"title":"Recent Algorithmic Advances in Population Protocols","authors":"Dan Alistarh, Rati Gelashvili","doi":"10.1145/3289137.3289150","DOIUrl":"https://doi.org/10.1145/3289137.3289150","url":null,"abstract":"Population protocols are a popular model of distributed computing, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta [6] a little over a decade ago. In the meantime, the model has proved a useful abstraction for modeling various settings, from wireless sensor networks [35, 26], to gene regulatory networks [17], and chemical reaction networks [21]. In a nutshell, a population protocol consists of n agents with limited local state that interact randomly in pairs, according to an underlying communication graph, and cooperate to collectively compute global predicates. From a theoretical prospective, population protocols, with the restricted communication and computational power, are probably one of the simplest distributed model one can imagine. Perhaps surprisingly though, solutions to many classical distributed tasks are still possible. Moreover, these solutions often rely on interesting algorithmic ideas for design and interesting probabilistic techniques for analysis, while known lower bound results revolve around complex combinatorial arguments.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"16 1","pages":"63-73"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89786844","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}
Video games provide entertainment to those who play them. This book looks at the hidden mathematics behind video games. It is meant for all those who love playing video games, so that they may explore mathematical ideas in the games. It is also aimed at mathematics teachers for inspiring their students, and for all those who love mathematics and games. Even those who hate mathematics but love video games are also a part of the target audience of this book. However, this particular category of readers needs at least some familiarity with high school mathematics to benefit from the book. The author states that many people enjoy playing computer / video games but few would be indulging themselves in doing some math. He terms this a consequence of poor marketing of mathematics since time immemorial. The main purpose of the book is to highlight that mathematics can be fun and that it can be found even in the most unbelievable or unexpected places such as in computer games.
{"title":"Review of Power Up:: Unlocking the hidden mathematics in video games","authors":"S. Nagaraj","doi":"10.1145/3289137.3289141","DOIUrl":"https://doi.org/10.1145/3289137.3289141","url":null,"abstract":"Video games provide entertainment to those who play them. This book looks at the hidden mathematics behind video games. It is meant for all those who love playing video games, so that they may explore mathematical ideas in the games. It is also aimed at mathematics teachers for inspiring their students, and for all those who love mathematics and games. Even those who hate mathematics but love video games are also a part of the target audience of this book. However, this particular category of readers needs at least some familiarity with high school mathematics to benefit from the book. The author states that many people enjoy playing computer / video games but few would be indulging themselves in doing some math. He terms this a consequence of poor marketing of mathematics since time immemorial. The main purpose of the book is to highlight that mathematics can be fun and that it can be found even in the most unbelievable or unexpected places such as in computer games.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"51 1","pages":"14-19"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73834537","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}
The 3rd edition of the Highlights of Algorithms (HALG) conference took place in Amsterdam, June 46, 2018. In this report, the chairs of the Steering Committee and the Program Committee discuss the role, format and impact of the conference until now, and describe their goals and motivation for the future.
{"title":"3rd Highlights of Algorithms (HALG 2018)","authors":"A. Czumaj, Robert Krauthgamer","doi":"10.1145/3289137.3289151","DOIUrl":"https://doi.org/10.1145/3289137.3289151","url":null,"abstract":"The 3rd edition of the Highlights of Algorithms (HALG) conference took place in Amsterdam, June 46, 2018. In this report, the chairs of the Steering Committee and the Program Committee discuss the role, format and impact of the conference until now, and describe their goals and motivation for the future.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"19 1","pages":"74-77"},"PeriodicalIF":0.0,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82664965","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}
good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations (“Continuation of proof of Theorem . . . ”). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to figure in the proof of capstone Theorem 3.71 (Schlömilch’s formula) on page 114. This nonstandard approach to chapter organization may impede some readers’ comprehending the structure of the author’s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages
好，不支持这个;“示例”的标签用相当小的字体，后面跟着一个“证明”，并且示例的主体是非斜体的，与其他带有演示的语句完全不同。一些定理的证明是在必要的引理的陈述和证明之后继续进行的，没有有用的划分(“定理证明的延续……”)。”)。最后，至少有一个引理(3.34)有一个没有定理或命题的推论;引理3.36的状态也不清楚。第12页的引理1.16给出了第二类斯特林数的封闭公式，这对于第114页的顶点定理3.71 (Schlömilch的公式)的证明是非常重要的。这种非标准的章节组织方法可能会阻碍一些读者理解作者高度目的性讨论的结构。本书作者:Charalambos A. Charalambides出版商:Chapman & Hall/CRC ISBN L-58488-290-5，精装，609页
{"title":"Enumerative combinatorics","authors":"C. Charalambides","doi":"10.1145/1466390.1466395","DOIUrl":"https://doi.org/10.1145/1466390.1466395","url":null,"abstract":"good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations (“Continuation of proof of Theorem . . . ”). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to figure in the proof of capstone Theorem 3.71 (Schlömilch’s formula) on page 114. This nonstandard approach to chapter organization may impede some readers’ comprehending the structure of the author’s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"38 1","pages":"25-27"},"PeriodicalIF":0.0,"publicationDate":"2018-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72679776","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：