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

Complexity and Approximation最新文献

筛选
英文 中文
Who Asked Us? How the Theory of Computing Answers Questions about Analysis 谁问我们?计算理论如何回答有关分析的问题
Complexity and Approximation Pub Date : 2019-11-30 DOI: 10.1007/978-3-030-41672-0_4
J. H. Lutz, Neil Lutz
{"title":"Who Asked Us? How the Theory of Computing Answers Questions about Analysis","authors":"J. H. Lutz, Neil Lutz","doi":"10.1007/978-3-030-41672-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_4","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122616060","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}
引用次数: 8
Complexity and Approximation: In Memory of Ker-I Ko 复杂性与近似:纪念柯柯铭
Complexity and Approximation Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-41672-0
D. Du, Jie Wang
{"title":"Complexity and Approximation: In Memory of Ker-I Ko","authors":"D. Du, Jie Wang","doi":"10.1007/978-3-030-41672-0","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"23 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":"125283908","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
An Efficient Approximation Algorithm for the Steiner Tree Problem Steiner树问题的一种有效逼近算法
Complexity and Approximation Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-41672-0_15
Chi-Yeh Chen, S. Hsieh
{"title":"An Efficient Approximation Algorithm for the Steiner Tree Problem","authors":"Chi-Yeh Chen, S. Hsieh","doi":"10.1007/978-3-030-41672-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_15","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"12 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":"123706891","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
Better Upper Bounds for Searching on a Line with Byzantine Robots 用拜占庭机器人在一条线上搜索的更好上界
Complexity and Approximation Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-41672-0_9
Xiaoming Sun, Yuan Sun, Jialin Zhang
{"title":"Better Upper Bounds for Searching on a Line with Byzantine Robots","authors":"Xiaoming Sun, Yuan Sun, Jialin Zhang","doi":"10.1007/978-3-030-41672-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_9","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"37 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":"127775202","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}
引用次数: 6
A Note on the Position Value for Hypergraph Communication Situations 关于超图通信情形的位置值的注记
Complexity and Approximation Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-41672-0_14
Erfang Shan, Jilei Shi, W. Lv
{"title":"A Note on the Position Value for Hypergraph Communication Situations","authors":"Erfang Shan, Jilei Shi, W. Lv","doi":"10.1007/978-3-030-41672-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_14","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"40 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849734","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
首页 上一页
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学术官方微信