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.
{"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":"10 1","pages":"33-56"},"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}
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.
虽然方法各不相同，但在本专栏所回顾的三本书中，至少有一条主线贯穿其中:图，和/或它在现实世界中表现出来的更复杂的亲戚，网络:1。Sergey Kitaev和Vadim Lozin的《词汇与图表》。数学将两个概念联系在一起，这两个概念比最初看起来更紧密。詹姆斯·拉夫(James V. Rauff)评论。网络科学，Albert-Làszlò Barabàasi。介绍一个蓬勃发展和令人兴奋的新领域。帕诺斯·洛里达斯评论。Ulle Endriss编辑的《计算社会选择趋势》。这组文章是本专栏最近回顾的一个标题的后续文章。S.V. Nagaraj评论。请让我知道，如果你有兴趣评论任何书列在后面的页面可供评论。
{"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":"14 1","pages":"4-6"},"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}
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).
最热烈的感谢大卫和乔希用他们迷人的专栏开始了我们所有的夏天，“超越比特擦除的数量:最近发现的热力学计算成本提出的新的复杂性问题。”请继续关注复杂性理论专栏下一期的文章，即Lane A. Hemaspaandra和Holger Spakowski(暂定主题:团队对角化)，William Gasarch(完全不是暂定主题:第三次P对NP民意调查)，(再次!)William Gasarch(暂定主题:松饼问题)和Emanuele Viola(主题:待定)。
{"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":"7 1","pages":"32"},"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}
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!
{"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":"122 1","pages":"57"},"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}
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.)
{"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":"11 1","pages":"10-13"},"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}
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.
有两个民意调查询问理论家(和其他人)他们对P vs NP(以及其他问题)的看法[4,5]。这两篇文章都是由William Gasarch撰写的，发表在SIGACT News的复杂性专栏上，由Lane A. Hemaspaandra编辑。分别是2002年和2012年。既然威廉·加萨奇(William Gasarch)喜欢范德华登定理(Van der Waerden’s theorem)，你可能会认为下一次投票将在2022年;然而，莱恩问他是否可以早一点，这样他的专栏就可以第100期了。所以我们在这里。过去，民意调查的问题出现在莱恩的专栏中。这次它们出现在开放问题专栏中，这是有意义的，因为P对NP确实是一个开放问题。
{"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":"1987 1","pages":"29-31"},"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}
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.
复杂性理论，博弈论和经济学，蒂姆·拉夫加登，TR18-001。哪些分布距离是次线性可测试的?， Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002。证明prBPP = prP和“几乎”证明p6 = NP一样难，Roei Tell, TR18-003。张建军，张建军，张建军，等。一种有界平面宽度图匹配的电路复杂度。李建军，张建军，李建军，等。基于自适应布尔单调性的全时间序列测试。Grassmann图中的伪随机集具有近完美展开，Subhash Khot, Dor Minzer, Muli Safra, TR18-006。
{"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":"33 1","pages":"18-28"},"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}
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
社会选择理论是研究集体决策的一个经济学领域。集体决策的例子包括在一群人或朋友之间分享蛋糕或资源，在选举中统计选票，以及汇总各种专家的意见。计算社会选择是一门学科，可以被认为是在经济学和计算机科学的交叉点。这本书涉及与集体决策的计算方面有关的最新趋势。它包含了计算社会选择专家的贡献。本书分为三个部分，分别侧重于场景、技术和应用。它作为《计算社会选择手册》(Handbook of Computational Social Choice)的续集出版，剑桥大学出版社，2016年，我最近在本专栏中回顾了这本书(SIGACT News 48(4)， 2017年12月，第13-17页)。Ulle Endriss，这本书的编辑，也是《手册》的编辑。这本书是由非营利出版社AI Access出版的。它可以在URL http://research.illc.uva.nl/COST-IC1205/Book/上免费在线获得，而硬拷贝的价格非常名义。这本书的出版
{"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":"85 1","pages":"14-17"},"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}
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.
{"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":"35 1","pages":"7-9"},"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}
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.
{"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":"92 1","pages":"20-28"},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：