首页 | 本学科首页   官方微博 | 高级检索  
     


The complexity of computation and approximation of the t-ratio over one-dimensional interval data
Affiliation:1. Department of Econometrics, University of Economics, Winston Churchill Square 4, 13067 Prague 3, Czech Republic;2. Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 11000 Prague 1, Czech Republic;1. Department of Statistical Sciences, University of Padova, via C. Battisti 241, 35121 Padova, Italy;2. Research Center for Statistics and Geneva School of Economics and Management, University of Geneva, 1211 Geneva, Switzerland;1. School of Science, NanTong University, NanTong, 226007, PR China;2. School of Finance and Statistics, East China Normal University, Shanghai, 200241, PR China;3. Department of Mathematics, Shanxi Datong University, Datong, 037009, PR China;1. Faculty of Education, University of Macau, Macau, China;2. Faculty of Science and Technology, University of Macau, Macau, China
Abstract:
Keywords:Interval data  Computational complexity  NP-hardness  Inapproximability  Pseudopolynomial algorithms
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号