{"title":"Guest Column","authors":"Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas","doi":"10.1145/3544979.3544989","DOIUrl":"https://doi.org/10.1145/3544979.3544989","url":null,"abstract":"Given a polynomial fpx1; : : : ; xNq, we can wonder how we can evaluate it with a minimal number of arithmetic operations. Indeed, the task of the algorithm designer is to nd evolved processes which decrease this number. In the other direction, it could be interesting to be able to prove that there is no algorithm which does the computation in less than some number of operations. But how one could prove something like that? We will present here some methods which allow us to tackle the problem in the case of constant-depth algebraic circuits.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131055383","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 : 2022-06-10DOI: 10.1145/3544979.3544990
Dan Alistarh
{"title":"Distributed Computing Column 85 Elastic Consistency","authors":"Dan Alistarh","doi":"10.1145/3544979.3544990","DOIUrl":"https://doi.org/10.1145/3544979.3544990","url":null,"abstract":"Overview. In this column, we attempt to cover a new and exciting area in distributed computing, that is, distributed and parallel machine learning. Together with my students Giorgi Nadiradze and Ilia Markov, I share an expository version of a recent conference paper [30] which attempts to provide a \"consistency condition\" for optimization problems which appear in distributed computing and machine learning applications.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144937","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 : 2022-06-10DOI: 10.1145/3544979.3544991
Dan Alistarh, I. Markov, Giorgi Nadiradze
{"title":"Elastic Consistency","authors":"Dan Alistarh, I. Markov, Giorgi Nadiradze","doi":"10.1145/3544979.3544991","DOIUrl":"https://doi.org/10.1145/3544979.3544991","url":null,"abstract":"Machine learning models can match or surpass humans on specialized tasks such as image classification [20, 14], speech recognition [37], or complex games [39]. One key tool behind this progress has been a family of optimization methods which fall under the umbrella term of stochastic gradient descent (SGD) [35], which are by and large the method of choice for training large-scale machine learning models.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"428 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878052","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 : 2022-06-10DOI: 10.1145/3544979.3544993
Debasis Dwibedy, Rakesh Mohanty
{"title":"Online List Scheduling for Makespan Minimization","authors":"Debasis Dwibedy, Rakesh Mohanty","doi":"10.1145/3544979.3544993","DOIUrl":"https://doi.org/10.1145/3544979.3544993","url":null,"abstract":"In the modern interactive computing era, computational problems such as scheduling, rout- ing, sequencing, and resource management are online in nature. In the online framework, at the outset, an algorithm receives and processes inputs one by one in order without the knowledge of future inputs, unlike in an offline framework, where an algorithm knows the entire input sequence at the beginning. The design of mathematical models and efficient al- gorithms for the online framework constitutes a challenging and competitive area of research in Theoretical Computer Science. The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127768617","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 : 2022-06-10DOI: 10.1145/3544979.3544987
W. Gasarch, N. Hayes, Anthony Ostuni, Davin Park
{"title":"The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing Number","authors":"W. Gasarch, N. Hayes, Anthony Ostuni, Davin Park","doi":"10.1145/3544979.3544987","DOIUrl":"https://doi.org/10.1145/3544979.3544987","url":null,"abstract":"e present a known theorem with the following authors. Part 1 was proven by Hopcroft and Tarjan [10]. Part 2 is easy. Part 3 was proven by Garey, Johnson, and Stockmeyer [6]. Part 4 was proven by Appel, Haken, and Koch [2, 3].","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122281000","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 : 2022-06-10DOI: 10.1145/3544979.3544985
W. Gasarch
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3544979.3544985","DOIUrl":"https://doi.org/10.1145/3544979.3544985","url":null,"abstract":"This issue's Open Problem Column is by William Gasarch, Nathan Hayes, Anthony Ostuni, and Davin Park. It is The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115919282","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 : 2022-04-18DOI: 10.1145/3532737.3532741
W. Gasarch
{"title":"Review of A Map that Reflects the Territory","authors":"W. Gasarch","doi":"10.1145/3532737.3532741","DOIUrl":"https://doi.org/10.1145/3532737.3532741","url":null,"abstract":"LessWrong is a forum founded by Artificial Intelligence Theorist Eliezer Yudkowsky and Economist Robin Hanson in 2009. The stated philosophy is: We are a community dedicated to improving our reasoning and decision-making. We seek to hold true beliefs and to be effective at accomplishing our goals. More generally, we work to develop and practice the art of human rationality.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750661","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 : 2022-04-18DOI: 10.1145/3532737.3532743
Bogdsan Grechuk
{"title":"On the smallest open Diophantine equations","authors":"Bogdsan Grechuk","doi":"10.1145/3532737.3532743","DOIUrl":"https://doi.org/10.1145/3532737.3532743","url":null,"abstract":"This paper reports on the current status of the project in which we order all polynomial Diophantine equations by an appropriate version of \"size\", and then solve the equations in that order. We list the \"smallest\" equations that are currently open, both unrestricted and in various families, like the smallest open symmetric, 2-variable or 3-monomial equations. All the equations we discuss are amazingly simple to write down but some of them seem to be very difficult to solve.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115473657","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 : 2022-04-18DOI: 10.1145/3532737.3532740
W. Gasarch
{"title":"Review of Tales of Impossibility","authors":"W. Gasarch","doi":"10.1145/3532737.3532740","DOIUrl":"https://doi.org/10.1145/3532737.3532740","url":null,"abstract":"This book is about the 4 Greek problems of Antiquity. I will state them in a way that is absolutely whiggish.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133326756","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 : 2022-04-18DOI: 10.1145/3532737.3532746
Susanna F. de Rezende, Mika Göös, Robert Robere
{"title":"Guest Column","authors":"Susanna F. de Rezende, Mika Göös, Robert Robere","doi":"10.1145/3532737.3532746","DOIUrl":"https://doi.org/10.1145/3532737.3532746","url":null,"abstract":"We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search problems (TFNP) as a unifying language for these connections and discuss how this perspective suggests a whole programme for further research.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953350","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号
