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


Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Affiliation:1. KAIST, School of Computing, Daejeon, Republic of Korea;2. LIX, CNRS, École Polytechnique, Institute Polytechnique de Paris, France;1. Computer Science Department, Facultad de Ciencias Exactas y Naturales, University of Buenos Aires, Pabellón 0+Infinito, Ciudad Universitaria (C1428), Ciudad Autónoma de Buenos Aires, Argentina;2. Departamento de Matemáticas, Estadística y Computación, Facultad de Ciencias, Universidad de Cantabria, 39071 Santander, Spain;3. Facultad de Ingeniería, University of Buenos Aires, Av. Paseo Colón 850 (C1063) Ciudad Autónoma de Buenos Aires, Argentina;4. Instituto de Ciencias, Universidad Nacional de General Sarmiento, J. M. Gutiérrez 1150 (B1613GSX) Los Polvorines, Provincia de Buenos Aires, Argentina;1. Faculty of Mathematics and Research Platform Data Science, University of Vienna, Austria;2. Johann Radon Institute of Computational and Applied Mathematics, Austrian Academy of Sciences, Austria;3. Applied Mathematics: Institute for Analysis and Numerics, University of Münster, Germany;4. School of Data Science and Shenzhen Research Institute of Big Data, The Chinese University of Hong Kong, Shenzhen, China;5. Faculty of Mathematics, University of Vienna, Austria;1. School of Engineering, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;2. Graduate School of Advanced Science and Engineering, Hiroshima University, 1-3-1 Kagamiyama, Higashi-Hiroshima City, Hiroshima 739-8526, Japan
Abstract:
Keywords:Reliable computing  Bit-cost  Partial differential equations  PSPACE
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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