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

International Workshop Randomization and Approximation Techniques in Computer Science最新文献

筛选
英文 中文
Approximation on the Web: A Compendium of NP Optimization Problems 网络上的近似:NP优化问题汇编
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_10
P. Crescenzi, V. Kann
{"title":"Approximation on the Web: A Compendium of NP Optimization Problems","authors":"P. Crescenzi, V. Kann","doi":"10.1007/3-540-63248-4_10","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_10","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115744709","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}
引用次数: 59
Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures 关于非一致测度的资源有界随机性和可压缩性
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_17
Steven M. Kautz
{"title":"Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures","authors":"Steven M. Kautz","doi":"10.1007/3-540-63248-4_17","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_17","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126825285","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
Greedily Approximating the r-independent Set and k-center Problems on Random Instances 随机实例上r独立集与k中心问题的贪婪逼近
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_4
Bernd Kreuter, Till Nierhoff
{"title":"Greedily Approximating the r-independent Set and k-center Problems on Random Instances","authors":"Bernd Kreuter, Till Nierhoff","doi":"10.1007/3-540-63248-4_4","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_4","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126542189","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}
引用次数: 5
Weak and Strong Recognition by 2-way Randomized Automata 双向随机自动机的弱和强识别
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_15
A. Ambainis, R. Freivalds, Marek Karpinski
{"title":"Weak and Strong Recognition by 2-way Randomized Automata","authors":"A. Ambainis, R. Freivalds, Marek Karpinski","doi":"10.1007/3-540-63248-4_15","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_15","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763767","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}
引用次数: 1
Random-Based Scheduling: New Approximations and LP Lower Bounds 随机调度:新的近似和LP下界
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_11
Andreas S. Schulz, M. Skutella
{"title":"Random-Based Scheduling: New Approximations and LP Lower Bounds","authors":"Andreas S. Schulz, M. Skutella","doi":"10.1007/3-540-63248-4_11","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_11","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122382767","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}
引用次数: 66
Approximation Algorithms for Covering Polygons with Squares and Similar Problems 用平方覆盖多边形的近似算法及类似问题
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_3
C. Levcopoulos, Joachim Gudmundsson
{"title":"Approximation Algorithms for Covering Polygons with Squares and Similar Problems","authors":"C. Levcopoulos, Joachim Gudmundsson","doi":"10.1007/3-540-63248-4_3","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_3","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123189068","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}
引用次数: 16
Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines 一类有限状态机NP优化问题的概率逼近
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_13
Dawei Hong, J. Birget
{"title":"Probabilistic Approximation of Some NP Optimization Problems by Finite-State Machines","authors":"Dawei Hong, J. Birget","doi":"10.1007/3-540-63248-4_13","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_13","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599720","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
'Go with the winners' Generators with Applications to Molecular Modeling “与赢家同行”的分子建模应用生成器
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_12
Marcus Peinado, Thomas Lengauer
{"title":"'Go with the winners' Generators with Applications to Molecular Modeling","authors":"Marcus Peinado, Thomas Lengauer","doi":"10.1007/3-540-63248-4_12","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_12","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019208","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
Using Hard Problems to Derandomize Algorithms: An Incomplete Survey 用难题去随机化算法:一个不完整的调查
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_14
R. Impagliazzo
{"title":"Using Hard Problems to Derandomize Algorithms: An Incomplete Survey","authors":"R. Impagliazzo","doi":"10.1007/3-540-63248-4_14","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_14","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131479836","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}
引用次数: 1
Super-bits, Demi-bits, and NP/qpoly-natural Proofs 超级比特，半比特和NP/qpoly-natural证明
International Workshop Randomization and Approximation Techniques in Computer Science Pub Date : 1997-07-11 DOI: 10.1007/3-540-63248-4_8
S. Rudich
{"title":"Super-bits, Demi-bits, and NP/qpoly-natural Proofs","authors":"S. Rudich","doi":"10.1007/3-540-63248-4_8","DOIUrl":"https://doi.org/10.1007/3-540-63248-4_8","url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115577966","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}
引用次数: 34
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信