1 citations · 1 across the 6 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.CC2022
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
Manon Blanc, Olivier Bournez
In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (O…
cs.CC2022
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations
Manon Blanc, Olivier Bournez
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also kn…
cs.CC2022★ 1 cited
Computational Complexity of Multi-Player Evolutionarily Stable Strategies
Manon Blanc, Kristoffer Arnsfelt Hansen
In this paper we study the computational complexity of computing an evolutionary stable strategy (ESS) in multi-player symmetric games. For two-player games, deciding existence of…