Computational Complexity of Multi-player Evolutionarily Stable Strategies M Blanc, KA Hansen International Computer Science Symposium in Russia, 1-17, 2021 | 9 | 2021 |
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations M Blanc, O Bournez International Conference on Machines, Computations, and Universality, 58-74, 2022 | 6 | 2022 |
A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with … M Blanc, O Bournez 48th International Symposium on Mathematical Foundations of Computer Science …, 2023 | 5 | 2023 |
Quantifiying the Robustness of Dynamical Systems. Relating Time and Space to Length and Precision M Blanc, O Bournez 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), 2024 | 2 | 2024 |
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations M Blanc, O Bournez arXiv preprint arXiv:2307.11747, 2023 | 1 | 2023 |
The complexity of computing in continuous time: space complexity is precision M Blanc, O Bournez arXiv preprint arXiv:2403.02499, 2024 | | 2024 |
The domino problem is decidable for robust tilesets N Aubrun, M Blanc, O Bournez arXiv preprint arXiv:2402.04438, 2024 | | 2024 |
Measuring robustness of dynamical systems. Relating time and space to length and precision M Blanc, O Bournez arXiv preprint arXiv:2301.12723, 2023 | | 2023 |
Characterisations of polynomial-time and-space complexity classes over the reals Characterisations of polynomial-time and-space complexity classes over the reals M Blanc, O Bournez Twentieth International Conference on Computability and Complexity in …, 2023 | | 2023 |
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations M Blanc, O Bournez arXiv preprint arXiv:2209.13404, 2022 | | 2022 |