Algorithms and Computation in Mathematics最新文献

筛选
英文 中文
Geometry of Continued Fractions 连分式几何
Algorithms and Computation in Mathematics Pub Date : 2013-11-27 DOI: 10.1007/978-3-642-39368-6
O. Karpenkov
{"title":"Geometry of Continued Fractions","authors":"O. Karpenkov","doi":"10.1007/978-3-642-39368-6","DOIUrl":"https://doi.org/10.1007/978-3-642-39368-6","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752103","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}
引用次数: 54
Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra 对合——微分方程的形式理论及其在计算机代数中的应用
Algorithms and Computation in Mathematics Pub Date : 2009-11-13 DOI: 10.1007/978-3-642-01287-7
W. Seiler
{"title":"Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra","authors":"W. Seiler","doi":"10.1007/978-3-642-01287-7","DOIUrl":"https://doi.org/10.1007/978-3-642-01287-7","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715033","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}
引用次数: 204
Combinatorial Algebraic Topology 组合代数拓扑
Algorithms and Computation in Mathematics Pub Date : 2007-10-30 DOI: 10.1007/978-3-540-71962-5
D. Kozlov
{"title":"Combinatorial Algebraic Topology","authors":"D. Kozlov","doi":"10.1007/978-3-540-71962-5","DOIUrl":"https://doi.org/10.1007/978-3-540-71962-5","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961224","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}
引用次数: 599
Computability of Julia Sets Julia集的可计算性
Algorithms and Computation in Mathematics Pub Date : 2006-10-10 DOI: 10.17323/1609-4514-2008-8-2-185-231
M. Braverman, M. Yampolsky
{"title":"Computability of Julia Sets","authors":"M. Braverman, M. Yampolsky","doi":"10.17323/1609-4514-2008-8-2-185-231","DOIUrl":"https://doi.org/10.17323/1609-4514-2008-8-2-185-231","url":null,"abstract":"Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. Their beauty and complexity can be fascinating. They also hold a deep mathematical content. Computational hardness of Julia sets is the main subject of this book. By definition, a computable set in the plane can be visualized on a computer screen with an arbitrarily high magnification. There are countless programs to draw Julia sets. Yet, as the authors have discovered, it is possible to constructively produce examples of quadratic polynomials, whose Julia sets are not computable. This result is striking - it says that while a dynamical system can be described numerically with an arbitrary precision, the picture of the dynamics cannot be visualized. The book summarizes the present knowledge (most of it from the authors' own work) about the computational properties of Julia sets in a self-contained way. It is accessible to experts and students with interest in theoretical computer science or dynamical systems.","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132196829","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}
引用次数: 72
Completeness and Reduction in Algebraic Complexity Theory 代数复杂性理论中的完备性与约简
Algorithms and Computation in Mathematics Pub Date : 2000-07-26 DOI: 10.1007/978-3-662-04179-6
Peter Bürgisser
{"title":"Completeness and Reduction in Algebraic Complexity Theory","authors":"Peter Bürgisser","doi":"10.1007/978-3-662-04179-6","DOIUrl":"https://doi.org/10.1007/978-3-662-04179-6","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130227307","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}
引用次数: 208
Computational methods in commutative algebra and algebraic geometry 交换代数和代数几何中的计算方法
Algorithms and Computation in Mathematics Pub Date : 1997-11-06 DOI: 10.1007/978-3-642-58951-5
W. Vasconcelos
{"title":"Computational methods in commutative algebra and algebraic geometry","authors":"W. Vasconcelos","doi":"10.1007/978-3-642-58951-5","DOIUrl":"https://doi.org/10.1007/978-3-642-58951-5","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121871071","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}
引用次数: 410
Some tapas of computer algebra 计算机代数的一些小技巧
Algorithms and Computation in Mathematics Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-03891-8
A. Cohen
{"title":"Some tapas of computer algebra","authors":"A. Cohen","doi":"10.1007/978-3-662-03891-8","DOIUrl":"https://doi.org/10.1007/978-3-662-03891-8","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131348560","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}
引用次数: 117
Two Algebraic Byways from Differential Equations: Gröbner Bases and Quivers 微分方程的两种代数途径:Gröbner基与颤振
Algorithms and Computation in Mathematics Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-26454-3
{"title":"Two Algebraic Byways from Differential Equations: Gröbner Bases and Quivers","authors":"","doi":"10.1007/978-3-030-26454-3","DOIUrl":"https://doi.org/10.1007/978-3-030-26454-3","url":null,"abstract":"","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115106745","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}
引用次数: 2
Algebraic aspects of cryptography 密码学的代数方面
Algorithms and Computation in Mathematics Pub Date : 1900-01-01 DOI: 10.5860/choice.36-2204
N. Koblitz
{"title":"Algebraic aspects of cryptography","authors":"N. Koblitz","doi":"10.5860/choice.36-2204","DOIUrl":"https://doi.org/10.5860/choice.36-2204","url":null,"abstract":"1. Cryptography.- 1. Early History.- 2. The Idea of Public Key Cryptography.- 3. The RSA Cryptosystem.- 4. Diffie-Hellman and the Digital Signature Algorithm.- 5. Secret Sharing, Coin Flipping, and Time Spent on Homework.- 6. Passwords, Signatures, and Ciphers.- 7. Practical Cryptosystems and Useful Impractical Ones.- Exercises.- 2. Complexity of Computations.- 1. The Big-O Notation.- Exercises.- 2. Length of Numbers.- Exercises.- 3. Time Estimates.- Exercises.- 4. P, NP, and NP-Completeness.- Exercises.- 5. Promise Problems.- 6. Randomized Algorithms and Complexity Classes.- Exercises.- 7. Some Other Complexity Classes.- Exercises.- 3. Algebra.- 1. Fields.- Exercises.- 2. Finite Fields.- Exercises.- 3. The Euclidean Algorithm for Polynomials.- Exercises.- 4. Polynomial Rings.- Exercises.- 5. Grobner Bases.- Exercises.- 4. Hidden Monomial Cryptosystems.- 1. The Imai-Matsumoto System.- Exercises.- 2. Patarin's Little Dragon.- Exercises.- 3. Systems That Might Be More Secure.- Exercises.- 5. Combinatorial-Algebraic Cryptosystems.- 1. History.- 2. Irrelevance of Brassard's Theorem.- Exercises.- 3. Concrete Combinatorial-Algebraic Systems.- Exercises.- 4. The Basic Computational Algebra Problem.- Exercises.- 5. Cryptographic Version of Ideal Membership.- 6. Linear Algebra Attacks.- 7. Designing a Secure System.- 6. Elliptic and Hyperelliptic Cryptosystems.- 1. Elliptic Curves.- Exercises.- 2. Elliptic Curve Cryptosystems.- Exercises.- 3. Elliptic Curve Analogues of Classical Number Theory Problems.- Exercises.- 4. Cultural Background: Conjectures on Elliptic Curves and Surprising Relations with Other Problems.- 5. Hyperelliptic Curves.- Exercises.- 6. Hyperelliptic Cryptosystems.- Exercises.- 1. Basic Definitions and Properties.- 2. Polynomial and Rational Functions.- 3. Zeros and Poles.- 4. Divisors.- 5. Representing Semi-Reduced Divisors.- 6. Reduced Divisors.- 7. Adding Reduced Divisors.- Exercises.- Answers to Exercises.","PeriodicalId":340360,"journal":{"name":"Algorithms and Computation in Mathematics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126024270","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}
引用次数: 496
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书