ACM SIGACT NewsPub Date : 2021-10-17DOI: 10.1145/3494656.3494666
Carlo Mereghetti, Beatrice Palano
{"title":"Guest Column","authors":"Carlo Mereghetti, Beatrice Palano","doi":"10.1145/3494656.3494666","DOIUrl":"https://doi.org/10.1145/3494656.3494666","url":null,"abstract":"Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117009675","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}
ACM SIGACT NewsPub Date : 2021-10-17DOI: 10.1145/3494656.3494661
D. Kelley
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3494656.3494661","DOIUrl":"https://doi.org/10.1145/3494656.3494661","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":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133246083","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}
ACM SIGACT NewsPub Date : 2021-10-17DOI: 10.1145/3494656.3494658
Frederic Green
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3494656.3494658","DOIUrl":"https://doi.org/10.1145/3494656.3494658","url":null,"abstract":"This column, the spotlight is on complexity, computational and communicational: 1. Mathematics and Computation, by Avi Wigderson. A sweeping look at computational complexity and adjacent fields, especially how they interact with mathematics. Review by Frederic Green. 2. Communication Complexity and Applications, by Anup Rao and Amir Yehudayoff. A textbook on this important topic. Review by Micha¨el Cadilhac. As always, please contact me to write a review; choose from among the books listed on the next pages, or, if you are interested in anything not on the list, just send me a note.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114284714","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}
ACM SIGACT NewsPub Date : 2021-10-17DOI: 10.1145/3494656.3494660
M. Cadilhac
{"title":"Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff","authors":"M. Cadilhac","doi":"10.1145/3494656.3494660","DOIUrl":"https://doi.org/10.1145/3494656.3494660","url":null,"abstract":"At its core, communication complexity is the study of the amount of information two parties need to exchange in order to compute a function. For instance, Alice receives a string of characters, Bob receives another, and they should decide whether these strings are the same with as few rounds of communication as possible. Multiple settings are conceivable, for instance with multiple parties or with randomness. Upper and lower bounds for communication problems rely on a wealth of mathematical tools, from probability theory to Ramsey theory, making this a complete and exciting topic. Further, communication complexity finds applications in different aspects of theoretical computer science, including circuit complexity and data structures. This usually requires to take a \"communication\" view of a problem, which in itself can be an eye-opening vantage point.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122137919","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}
ACM SIGACT NewsPub Date : 2021-10-17DOI: 10.1145/3494656.3494665
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 110","authors":"L. Hemaspaandra","doi":"10.1145/3494656.3494665","DOIUrl":"https://doi.org/10.1145/3494656.3494665","url":null,"abstract":"My deepest thanks to Beatrice and Carlo for their fascinating article, Quantum Finite Automata: From Theory to Practice. Regarding the extent to which their article brings to life both parts of its subtitle... wow! And I think Section 4 is an absolute first for this column; please don't miss it!","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129606124","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}
ACM SIGACT NewsPub Date : 2021-06-17DOI: 10.1145/3471469.3471473
W. Gasarch
{"title":"Review of Ideas that Created the Future","authors":"W. Gasarch","doi":"10.1145/3471469.3471473","DOIUrl":"https://doi.org/10.1145/3471469.3471473","url":null,"abstract":"What are the most important papers in computer science? What are the most important 46 papers in computer science? Yikes! Far more than 46 seem to qualify. Picking out the top 46 papers in computer science is the task that befallen Harry Lewis (henceforth Harry). I suspect it was both a burden (gee, which ones to omit?) and a joy (Wow, these papers are insightful!). He used two (probably more) criteria that helped him cut it down (1) he prefers short readable papers to long unreadable ones (don't we all!), and (2) no paper past 1980 (arbitrary but firm cutoff). There were also absurd financial constraints based on how much the rights to republish a paper costs. In some cases a paper that is available online for free cost too much to put into a book. See my comment on Turing's 1936 paper. This book is a collection of the 46 most important papers in computer science, in the opinion of Harry, relative to some constraints. The complete list is at the end of the review. While I am sure many readers will think why isn't X in the list, or why is X in the list, or I never heard of X, I suspect that 2/3 of the people reading this review will agree with 2/3 of the papers on the list. I would urge people to read the book AND THEN have an intelligent debate about which papers should or should not be in it.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127579902","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}
ACM SIGACT NewsPub Date : 2021-06-17DOI: 10.1145/3471469.3471483
Dan Alistarh
{"title":"Distributed Computing Column 82 Distributed Computability","authors":"Dan Alistarh","doi":"10.1145/3471469.3471483","DOIUrl":"https://doi.org/10.1145/3471469.3471483","url":null,"abstract":"Overview. In this edition of the column, we have a very useful and interesting piece from Michel Raynal (IRISA Rennes & Hong Kong Polytechnic), whose goal is to provide a systematic view of the computability results in distributed computing which should be well-understood by any Masters-level student with an interest in our area. Michel's motivation for the column is that, given the intense proliferation of computational models, tasks, and correctness and progress conditions in recent years, for instance, in the context of Blockchain technology, it may be hard for newcomers to the field to understand the boundary between what is essentially possible and what is impossible in a distributed system.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133500066","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}
ACM SIGACT NewsPub Date : 2021-06-17DOI: 10.1145/3471469.3471478
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 109","authors":"L. Hemaspaandra","doi":"10.1145/3471469.3471478","DOIUrl":"https://doi.org/10.1145/3471469.3471478","url":null,"abstract":"Warmest thanks to Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan for this issue's guest column, Models of computation between decision trees and communication.\" (Their article came in early, and I wrote back thanking them for being three days early, mentioning that that happens surprisingly rarely. Then two days later, I said, Wow!\", as I realized that they actually had somehow|even during a remote-teaching, social-distancing time period|prepared and sent in their article a month and three days early.)","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123400202","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}
ACM SIGACT NewsPub Date : 2021-06-17DOI: 10.1145/3471469.3471480
R. van Stee
{"title":"SIGACT News Online Algorithms Column 37","authors":"R. van Stee","doi":"10.1145/3471469.3471480","DOIUrl":"https://doi.org/10.1145/3471469.3471480","url":null,"abstract":"For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125068746","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}
ACM SIGACT NewsPub Date : 2021-06-17DOI: 10.1145/3471469.3471474
W. Gasarch
{"title":"Review of Blown to Bits","authors":"W. Gasarch","doi":"10.1145/3471469.3471474","DOIUrl":"https://doi.org/10.1145/3471469.3471474","url":null,"abstract":"I reviewed the first edition of this book in 2009. Here is a link to the entire column which includes reviews of other books as well: https://www.cs.umd.edu/users/gasarch/bookrev/40-1.pdf If you are reading this as an online pdf you can probably click on the above line and get to my old review. (Is that illegal on your part? On my part? I have no idea.) Some of this review will overlap with some of that review. I begin with the first paragraph of my old review just to show how one issue seems to have been solved.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128313699","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号
