Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization

Q4 Mathematics
E. Allender
{"title":"Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization","authors":"E. Allender","doi":"10.53733/148","DOIUrl":null,"url":null,"abstract":"We survey recent developments related to the Minimum Circuit Size Problem and time-bounded Kolmogorov Complexity.","PeriodicalId":30137,"journal":{"name":"New Zealand Journal of Mathematics","volume":"45 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Zealand Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53733/148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 10

Abstract

We survey recent developments related to the Minimum Circuit Size Problem and time-bounded Kolmogorov Complexity.
Vaughan Jones, Kolmogorov复杂性,以及围绕电路最小化的新复杂性景观
本文综述了最小电路尺寸问题和限时Kolmogorov复杂度的最新研究进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
New Zealand Journal of Mathematics
New Zealand Journal of Mathematics Mathematics-Algebra and Number Theory
CiteScore
1.10
自引率
0.00%
发文量
11
审稿时长
50 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信