Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data
Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova +1
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heav…
math.NA2018
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision
Svetlana Selivanova, Victor Selivanov
We establish upper bounds of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we continue the research started in in our revious public…