RANDOM-APPROX最新文献

筛选
英文 中文
On the Hardness of Approximate Multivariate Integration 关于近似多元积分的硬度
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_11
I. Koutis
{"title":"On the Hardness of Approximate Multivariate Integration","authors":"I. Koutis","doi":"10.1007/978-3-540-45198-3_11","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_11","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116347679","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}
引用次数: 3
Approximate Testing of Visual Properties 视觉特性的近似测试
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_31
Sofya Raskhodnikova
{"title":"Approximate Testing of Visual Properties","authors":"Sofya Raskhodnikova","doi":"10.1007/978-3-540-45198-3_31","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_31","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304943","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}
引用次数: 35
Computational Analogues of Entropy 熵的计算类似物
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_18
B. Barak, Ronen Shaltiel, A. Wigderson
{"title":"Computational Analogues of Entropy","authors":"B. Barak, Ronen Shaltiel, A. Wigderson","doi":"10.1007/978-3-540-45198-3_18","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_18","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172112","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}
引用次数: 115
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor 不含固定小项图的一个改进分解定理
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_4
Jittat Fakcharoenphol, Kunal Talwar
{"title":"An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor","authors":"Jittat Fakcharoenphol, Kunal Talwar","doi":"10.1007/978-3-540-45198-3_4","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_4","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020410","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}
引用次数: 58
Covering Graphs Using Trees and Stars 用树和星形覆盖图形
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_3
G. Even, Naveen Garg, J. Könemann, R. Ravi, Amitabh Sinha
{"title":"Covering Graphs Using Trees and Stars","authors":"G. Even, Naveen Garg, J. Könemann, R. Ravi, Amitabh Sinha","doi":"10.1007/978-3-540-45198-3_3","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_3","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115446245","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}
引用次数: 25
On the Complexity of Approximating k-Dimensional Matching 关于近似k维匹配的复杂度
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_8
Elad Hazan, S. Safra, O. Schwartz
{"title":"On the Complexity of Approximating k-Dimensional Matching","authors":"Elad Hazan, S. Safra, O. Schwartz","doi":"10.1007/978-3-540-45198-3_8","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_8","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125425636","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}
引用次数: 50
Improved Linear Time Approximation Algorithms for Weighted Matchings 加权匹配的改进线性时间逼近算法
RANDOM-APPROX Pub Date : 2003-08-24 DOI: 10.1007/978-3-540-45198-3_2
D. Vinkemeier, S. Hougardy
{"title":"Improved Linear Time Approximation Algorithms for Weighted Matchings","authors":"D. Vinkemeier, S. Hougardy","doi":"10.1007/978-3-540-45198-3_2","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_2","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115401707","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}
引用次数: 42
On the Graph-Density of Random 0/1-Polytopes 关于随机0/1多面体的图密度
RANDOM-APPROX Pub Date : 2003-06-17 DOI: 10.1007/978-3-540-45198-3_27
V. Kaibel, Anja Remshagen
{"title":"On the Graph-Density of Random 0/1-Polytopes","authors":"V. Kaibel, Anja Remshagen","doi":"10.1007/978-3-540-45198-3_27","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_27","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116632165","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}
引用次数: 9
Continuous-Time Quantum Walks on the Symmetric Group 对称群上的连续时间量子行走
RANDOM-APPROX Pub Date : 2003-05-29 DOI: 10.1007/978-3-540-45198-3_25
Heath Gerhardt, John Watrous
{"title":"Continuous-Time Quantum Walks on the Symmetric Group","authors":"Heath Gerhardt, John Watrous","doi":"10.1007/978-3-540-45198-3_25","DOIUrl":"https://doi.org/10.1007/978-3-540-45198-3_25","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127645612","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}
引用次数: 60
Error-Correcting Codes and Pseudorandom Projections 纠错码与伪随机投影
RANDOM-APPROX Pub Date : 2001-08-18 DOI: 10.1007/3-540-44666-4_4
L. Trevisan
{"title":"Error-Correcting Codes and Pseudorandom Projections","authors":"L. Trevisan","doi":"10.1007/3-540-44666-4_4","DOIUrl":"https://doi.org/10.1007/3-540-44666-4_4","url":null,"abstract":"","PeriodicalId":353245,"journal":{"name":"RANDOM-APPROX","volume":"50 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131042900","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}
引用次数: 3
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学术官方微信
小红书