An efficient fully polynomial approximation scheme for the Subset-Sum Problem
- 作者Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza
- 卷第66卷
- 期第2期
- 印刷ISSN0022-0000
- 电子ISSN1090-2724
- 文件大小238.31KB
- 发表时间2003
- DOI10.1016/s0022-0000(03)00006-0
- 页码349-370
Book reviewMichal Koucký · 2010
Incremental Branching ProgramsAnna Gál; Michal Koucký; Pierre McKenzie · 2008
Circuit Complexity of Regular LanguagesMichal Koucký · 2009
Power from Random StringsAllender, Eric; Buhrman, Harry; Koucký, Michal; van Melkebeek, Dieter; Ronneburger, Detlef · SIAM Journal on Computing · 2006
The Hardness of Being PrivateAda, Anil; Chattopadhyay, Arkadev; Cook, Stephen A.; Fontes, Lila; Koucký, Michal; Pitassi, Toniann · ACM Transactions on Computation Theory · 2014
Agreement on intrapartum cardiotocogram recordings between expert obstetriciansHruban, Lukáš; Spilka, Jiří; Chudáček, Václav; Janků, Petr; Huptych, Michal; Burša, Miroslav; Hudec, Adam; Kacerovský, Marian; Koucký, Michal; Procházka, Martin; Korečko, Vladimír; Seget'a, Jan; Šimetka, Ondřej; Měchurová, Alena; Lhotská, Lenka · Journal of Evaluation in Clinical Practice · 2015
Simulation Theorems via Pseudo-random PropertiesChattopadhyay, Arkadev; Koucký, Michal; Loff, Bruno; Mukhopadhyay, Sagnik · computational complexity · 2019