This issue's column brings to a close the half-year of Bill in the Complexity Theorem Column. In particular, the previous issue's Complexity Theory Column was Bill Gasarch's third P versus NP poll, and this issue's column is Bill, Erik, Jacob, and Scott's article on the muffin problem. Warmest thanks to Bill, Erik, Jacob, and Scott for their splendid baking! Quite naturally given that their article is rich in conjectures, this article is brought to you not just by the Complexity Theory Column, but in fact is a joint production with the Open Problems Column, the letter M, and the number 157 286 .
{"title":"SIGACT News Complexity Theory Column 101","authors":"L. Hemaspaandra","doi":"10.1145/3351452.3351461","DOIUrl":"https://doi.org/10.1145/3351452.3351461","url":null,"abstract":"This issue's column brings to a close the half-year of Bill in the Complexity Theorem Column. In particular, the previous issue's Complexity Theory Column was Bill Gasarch's third P versus NP poll, and this issue's column is Bill, Erik, Jacob, and Scott's article on the muffin problem. Warmest thanks to Bill, Erik, Jacob, and Scott for their splendid baking! Quite naturally given that their article is rich in conjectures, this article is brought to you not just by the Complexity Theory Column, but in fact is a joint production with the Open Problems Column, the letter M, and the number 157 286 .","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77643182","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}
You have m muffins and s students. You want to divide the muffins into pieces and give the shares to students such that every student has m s muffins and the minimum piece is maximized. Let f(m; s) be the minimum piece in the optimal protocol. We present, by examples, several methods to obtain upper and lower bounds on f(m; s).
{"title":"Guest Column: The Muffin Problem","authors":"W. Gasarch, S. Huddleston, Erik Metz, Jacob Prinz","doi":"10.1145/3351452.3351462","DOIUrl":"https://doi.org/10.1145/3351452.3351462","url":null,"abstract":"You have m muffins and s students. You want to divide the muffins into pieces and give the shares to students such that every student has m s muffins and the minimum piece is maximized. Let f(m; s) be the minimum piece in the optimal protocol. We present, by examples, several methods to obtain upper and lower bounds on f(m; s).","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79923638","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}
There are probably at least as many different approaches to number theory as there are books written about it. Some broad distinctions include those taking an historical versus (say) a purely modern approach, with many gradations in between, or those that are algebraically oriented (e.g., with an emphasis on reciprocity laws, or questions that relate to algebraic geometry), or still others that are more analytic. The book under review is definitely in the latter category. The "message" of the book is in the title, as primes and their density are the principle concern. In accordance with that theme, a highlight of the book is a complete proof of the prime number theorem. However, the theme and its variations are taken as springboards to other important fields, including aspects of algebraic number theory, as well as applications, such as primality testing and cryptography.
{"title":"Review of Number Theory: An Introduction via the Density of Primes, second edition","authors":"Frederic Green","doi":"10.1145/3319627.3319630","DOIUrl":"https://doi.org/10.1145/3319627.3319630","url":null,"abstract":"There are probably at least as many different approaches to number theory as there are books written about it. Some broad distinctions include those taking an historical versus (say) a purely modern approach, with many gradations in between, or those that are algebraically oriented (e.g., with an emphasis on reciprocity laws, or questions that relate to algebraic geometry), or still others that are more analytic. The book under review is definitely in the latter category. The \"message\" of the book is in the title, as primes and their density are the principle concern. In accordance with that theme, a highlight of the book is a complete proof of the prime number theorem. However, the theme and its variations are taken as springboards to other important fields, including aspects of algebraic number theory, as well as applications, such as primality testing and cryptography.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88044966","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 2018 ACM Symposium on Parallelism in Algorithms and Architectures was held on July 1618 in Vienna, Austria. The conference took place on the TU Wien campus in the Engineering building, an ideal location that was walking distance to central Vienna as well as historic buildings like Karlskirche and St. Stephen's Cathedral. Thanks to the organizers, presenters and attendees for their hard work that made this conference possible!
{"title":"SPAA 2018 Review","authors":"Laxman Dhulipala","doi":"10.1145/3319627.3319638","DOIUrl":"https://doi.org/10.1145/3319627.3319638","url":null,"abstract":"The 2018 ACM Symposium on Parallelism in Algorithms and Architectures was held on July 1618 in Vienna, Austria. The conference took place on the TU Wien campus in the Engineering building, an ideal location that was walking distance to central Vienna as well as historic buildings like Karlskirche and St. Stephen's Cathedral. Thanks to the organizers, presenters and attendees for their hard work that made this conference possible!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77670590","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 two books, both mathematical, the second containing more of an emphasis on applications:
在这个专栏中，我们回顾两本书，都是数学的，第二本书更强调应用:
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3319627.3319629","DOIUrl":"https://doi.org/10.1145/3319627.3319629","url":null,"abstract":"In this column we review two books, both mathematical, the second containing more of an emphasis on applications:","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86717165","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 is column number 100, and Bill Gasarch has very kindly made it an event! In particular, this issue's column is the third of Bill Gasarch's series of polls on the eld's thoughts on P vs. NP (and other central issues in complexity). The rst two polls in the series appeared as SIGACT News Complexity Theory Columns 36 and 74. Warmest thanks to Bill Gasarch for having undertaken the huge task of creating the poll, gathering the responses, analyzing them, and writing this article on what the poll reveals, and to Clyde Kruskal who was Bill's magical elf on proofreading, polishing, and even knocking on doors to ask people what they think of P versus NP. (Psst: Bill and Clyde's 2019 book, "problems with a Point: Exploring Math and Computer Science" (https://www.worldscienti c.com/worldscibooks/10.1142/11261), sounds absolutely fascinating!)
{"title":"SIGACT News Complexity Theory Column 100","authors":"L. Hemaspaandra","doi":"10.1145/3319627.3319635","DOIUrl":"https://doi.org/10.1145/3319627.3319635","url":null,"abstract":"This is column number 100, and Bill Gasarch has very kindly made it an event! In particular, this issue's column is the third of Bill Gasarch's series of polls on the eld's thoughts on P vs. NP (and other central issues in complexity). The rst two polls in the series appeared as SIGACT News Complexity Theory Columns 36 and 74.\u0000 Warmest thanks to Bill Gasarch for having undertaken the huge task of creating the poll, gathering the responses, analyzing them, and writing this article on what the poll reveals, and to Clyde Kruskal who was Bill's magical elf on proofreading, polishing, and even knocking on doors to ask people what they think of P versus NP. (Psst: Bill and Clyde's 2019 book, \"problems with a Point: Exploring Math and Computer Science\" (https://www.worldscienti c.com/worldscibooks/10.1142/11261), sounds absolutely fascinating!)","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89941204","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}
With increased public interest in the ancient game of Go since 2016, it is an espe- cially good time to use it in teaching. The game is an excellent source of exercises in the theory of computation. We give some exercises developed during our research on Go which were then used when teaching this subject at Monash University. These are based on One-Dimensional Go (1D-Go) which uses a path graph as its board. They are about determining whether or not a position is legal and counting the number of legal positions. Curriculum elements that may be illustrated and practised using 1D-Go include: regular expressions, linear recurrences, proof by induction, nite automata, regular grammars, context-free grammars and languages, pushdown automata, and Turing machines.
{"title":"Using Go in teaching the theory of computation","authors":"G. Farr","doi":"10.1145/3319627.3319639","DOIUrl":"https://doi.org/10.1145/3319627.3319639","url":null,"abstract":"With increased public interest in the ancient game of Go since 2016, it is an espe- cially good time to use it in teaching. The game is an excellent source of exercises in the theory of computation. We give some exercises developed during our research on Go which were then used when teaching this subject at Monash University. These are based on One-Dimensional Go (1D-Go) which uses a path graph as its board. They are about determining whether or not a position is legal and counting the number of legal positions. Curriculum elements that may be illustrated and practised using 1D-Go include: regular expressions, linear recurrences, proof by induction, nite automata, regular grammars, context-free grammars and languages, pushdown automata, and Turing machines.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81078405","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/3319627.3319632","DOIUrl":"https://doi.org/10.1145/3319627.3319632","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":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84539111","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 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.
{"title":"Guest Column: The Third P=?NP Poll","authors":"W. Gasarch","doi":"10.1145/3319627.3319636","DOIUrl":"https://doi.org/10.1145/3319627.3319636","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.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72888970","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 column contains a review of the 2018 ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) by Laxman Dhulipa. Laxman has provided an insightful overview of the keynote lectures and highlights of the contributed presentations, that I hope will inspire you to track down and read the papers, if you haven't done so already.
{"title":"Distributed Computing Column 73 SPAA 2018 Review","authors":"J. Welch","doi":"10.1145/3319627.3319637","DOIUrl":"https://doi.org/10.1145/3319627.3319637","url":null,"abstract":"This issue's column contains a review of the 2018 ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) by Laxman Dhulipa. Laxman has provided an insightful overview of the keynote lectures and highlights of the contributed presentations, that I hope will inspire you to track down and read the papers, if you haven't done so already.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85210645","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
扫码关注我们
求助内容：
应助结果提醒方式：