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

SIGACT News最新文献

筛选
英文 中文
Beyond Number of Bit Erasures: New Complexity Questions Raisedby Recently discovered thermodynamic costs of computation 超越位擦除数:由最近发现的计算热力学成本提出的新的复杂性问题
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232689
Joshua A. Grochow, D. Wolpert
{"title":"Beyond Number of Bit Erasures: New Complexity Questions Raisedby Recently discovered thermodynamic costs of computation","authors":"Joshua A. Grochow, D. Wolpert","doi":"10.1145/3232679.3232689","DOIUrl":"https://doi.org/10.1145/3232679.3232689","url":null,"abstract":"Recent advances in nonequilibrium statistical mechanics have led to a deeper understanding of the thermodynamic cost of computation than that put forth by Landauer and then studied extensively in the computational complexity community. In particular, Landauer's work led to a focus on the number of bit erasures in a computation, due to its relation to the change in entropy between input and output. However new advances in physics|which have been experimentally con rmed|mean we can now calculate additional thermodynamic costs beyond merely the change in entropy between input and output. As a consequence, we now understand that while logically reversible computing can have some thermodynamic bene ts, it is far from the end of the story. The purpose of this paper is to highlight new open questions in computational complexity raised by consideration of these new thermodynamic costs. Beyond leading to a revised viewpoint on the bene ts of logical reversibility, these questions touch on randomized algorithms, average-case complexity, the thermodynamic cost of error correcting codes, and noisy/inexact/approximate computation.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72700018","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}
引用次数: 4
The Book Review Column 书评专栏
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232681
Frederic Green
{"title":"The Book Review Column","authors":"Frederic Green","doi":"10.1145/3232679.3232681","DOIUrl":"https://doi.org/10.1145/3232679.3232681","url":null,"abstract":"While the approaches are all different, there is at least one thread running through the three books reviewed in this column: the graph, and/or its more complex relative as manifested in the real world, the network: 1. Words and Graphs, by Sergey Kitaev and Vadim Lozin. The mathematics connecting two ideas that are more closely related than might at first appear. Review by James V. Rauff. 2. Network Science, by Albert-Làszlò Barabàasi. An introduction to a burgeoning and exciting new field. Review by Panos Louridas. 3. Trends in Computational Social Choice, edited by Ulle Endriss. This collection of articles is a follow-up to a title reviewed recently in this column. Review by S.V. Nagaraj. Please let me know if you are interested in reviewing any of the books listed on the subsequent page are available for review.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84179895","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 98 SIGACT新闻复杂性理论专栏
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232688
L. Hemaspaandra
{"title":"SIGACT News Complexity Theory Column 98","authors":"L. Hemaspaandra","doi":"10.1145/3232679.3232688","DOIUrl":"https://doi.org/10.1145/3232679.3232688","url":null,"abstract":"This Issue Warmest thanks to David and Josh for starting all of our summers with their fascinating column, Beyond number of bit erasures: New complexity questions raised by recently discovered thermodynamic costs of computation.\" Future Issues Please stay tuned for the coming issues' articles in the Complexity Theory Column, namely, Lane A. Hemaspaandra and Holger Spakowski (tentative topic: team diagonalization), William Gasarch (not-at-all-tentative topic: the third P versus NP poll), (again!) William Gasarch (tentative topic: the muffin problem), and Emanuele Viola (topic: TBD).","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86530275","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
Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects 分布式计算第70专栏:分布式账本对象的形式化和实现
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232690
J. Welch
{"title":"Distributed Computing Column 70: Formalizing and Implementing Distributed Ledger Objects","authors":"J. Welch","doi":"10.1145/3232679.3232690","DOIUrl":"https://doi.org/10.1145/3232679.3232690","url":null,"abstract":"Blockchains and distributed ledgers, the technologies underlying Bitcoin and other decentralized transaction systems, have been garnering increasing interest in the theoretical distributed comput- ing community. The current column, by Antonio Fernández Anta, Chryssis Georgiou, Kishori Konwar, and Nicolas Nicolaou, starts with an informative overview of the world of distributed ledgers and motivates the need for rigorous approaches. The authors present an approach for formally specifying a distributed ledger in the context of several popular consistency conditions. The authors then give algorithms that implement the di erent variants in message-passing systems subject to crash failures. The article closes with a discussion of intriguing open questions. Many thanks to Antonio, Chryssis, Kishori and Nicolas for their timely contribution!","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79462660","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 Network Science by Albert-Làaszlò Barabàasi 网络科学综述Albert-Làaszlò Barabàasi
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232683
Panos Louridas
{"title":"Review of Network Science by Albert-Làaszlò Barabàasi","authors":"Panos Louridas","doi":"10.1145/3232679.3232683","DOIUrl":"https://doi.org/10.1145/3232679.3232683","url":null,"abstract":"Albert-Làaszlò Barabàasi can be credited with bringing network science to the general public. After a series of papers in such heavyweights as Nature and Science, his book Linked gave a popular science account of the field. With Network Science he turns his attention to newcomer students who want to start from scratch and go through a wide ranging, yet accessible, introduction. The explosion of publications and interest in network science makes it easy to forget how new it is. True, the germs of network science were sown many decades back (one can think of the work of Yule and Zipf as early precursors), but it was not until the end of the millennium that scientists from different disciplines, ranging from computer science and mathematics to physics and statistics, started paying attention to what appear to be a set of unifying principles and underlying phenomena. Barabàasi did not invent the field, but his publications created a lot of buzz in many places; and in a short while, scientists all over were studying power laws, critical phenomena, and networks-not computer networks, just networks. (This reviewer remembers the period, when describing a course on network science he had to always add a proviso like \"this is not about computer networks\"; otherwise students would get the idea that this was about hardcore computer science. The situation has changed somewhat since then.)","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90096101","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 开放性问题专栏
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232686
W. Gasarch
{"title":"Open Problems Column","authors":"W. Gasarch","doi":"10.1145/3232679.3232686","DOIUrl":"https://doi.org/10.1145/3232679.3232686","url":null,"abstract":"There have been two polls asking theorists (and others) what they thought of P vs NP (and other questions) [4, 5]. Both were written by William Gasarch and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra. They were in 2002 and 2012. Since William Gasarch is fond of Van der Waerden's theorem, you would think the next poll would be 2022; however, Lane asked if it could be a bit earlier so as to be the 100th issue of his column. So here we are. In the past the questions for the poll appeared in Lane's column. This time they appear here in the Open Problems Column, which makes sense since, well, P vs NP is indeed an open problem.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82277720","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
Technical Report Column 技术报告专栏
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232685
D. Kelley
{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3232679.3232685","DOIUrl":"https://doi.org/10.1145/3232679.3232685","url":null,"abstract":"Complexity Theory, Game Theory, and Economics, Tim Roughgarden, TR18-001. Which Distribution Distances are Sublinearly Testable?, Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002. Proving that prBPP = prP is as hard as almost\" proving that P 6= NP, Roei Tell, TR18-003. Circuit Complexity of Bounded Planar Cutwidth Graph Matching, Aayush Ojha, Raghunath Tewari, TR18-004. Adaptive Boolean Monotonicity Testing in Total In uence Time, C. Seshadhri, Deeparnab Chakrabarty, TR18-005. Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion, Subhash Khot, Dor Minzer, Muli Safra, TR18-006.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72998117","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 Trends in Computational Social Choice Edited by Ulle Endriss 《计算社会选择趋势综述》，Ulle Endriss主编
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232684
S. Nagaraj
{"title":"Review of Trends in Computational Social Choice Edited by Ulle Endriss","authors":"S. Nagaraj","doi":"10.1145/3232679.3232684","DOIUrl":"https://doi.org/10.1145/3232679.3232684","url":null,"abstract":"Social choice theory is an area of economics that studies collective decision making. Examples of collective decision making include sharing a cake or a resource among a group of people or friends, tallying votes in an election, and aggregating opinions of various experts. Computational social choice is a discipline which may be considered to be at the intersection of economics and computer science. This book deals with recent trends related to computational aspects of collective decision making. It contains contributions of experts in computational social choice. The book is divided into three parts that focus on scenarios, techniques, and applications, respectively. It has been published as a sequel to the Handbook of Computational Social Choice, Cambridge University Press, 2016, recently reviewed by me in this column (SIGACT News 48(4), December 2017, pp. 13-17). Ulle Endriss, the editor of this book, was also an editor of the Handbook. This book has been published by AI Access, a not-for-profit publisher. It is available for free online at the URL http://research.illc.uva.nl/COST-IC1205/Book/, and the hard copy is very nominally priced. The book's publication","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83891430","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 Words and Graphs by Sergey Kitaev and Vadim Lozin Sergey Kitaev和Vadim Lozin的《词汇与图表》书评
SIGACT News Pub Date : 2018-06-13 DOI: 10.1145/3232679.3232682
J. Rauff
{"title":"Review of Words and Graphs by Sergey Kitaev and Vadim Lozin","authors":"J. Rauff","doi":"10.1145/3232679.3232682","DOIUrl":"https://doi.org/10.1145/3232679.3232682","url":null,"abstract":"Two distinct letters x and y in a word alternate if, after deleting all other letters in the word, the resulting word is of the form xyxy : : : or yxyx : : : . A graph G = (V;E) is word-representable if there exists a word w over the alphabet V such that the letters x and y alternate in w if and only if there is an edge connecting x and y in G. If graphs can be represented by words then exciting new possibilities arise for investigating graph properties in terms of the properties of the words that represent them. In addition, words (i.e. strings) would offer an additional way of storing and manipulating graph structures in computation. This textbook is a comprehensive survey of word-representable graphs and the relationships between combinatorics on words and graph properties. The contents are accessible to graph theorists, formal language theorists, computer scientists, and students who have some familiarity with graph theory and words.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79985567","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
Joint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer Steve Wright的《二次残数与非残数》和Oswald Baumgart的《二次互反律》的联合评述，Franz Lemmermeyer编辑并翻译
SIGACT News Pub Date : 2018-03-14 DOI: 10.1145/3197406.3197411
Frederic Green
{"title":"Joint Review of Quadratic Residues and Non-Residues by Steve Wright and The Quadratic Reciprocity Law by Oswald Baumgart Edited and translated by Franz Lemmermeyer","authors":"Frederic Green","doi":"10.1145/3197406.3197411","DOIUrl":"https://doi.org/10.1145/3197406.3197411","url":null,"abstract":"In his Disquisitiones Arithmeticæ, quoted above, Gauss called it the “fundamental theorem” that “must certainly be regarded as one of the most elegant of its type.”5 In private, he dubbed it the “Theorema Aureum,” the “Golden Theorem.” The law itself, its many proofs, its implications and generalizations, its influence on the advancement of number theory, and the underlying history, are deep and fascinating.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80911410","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学术官方微信