Valentin Dardilhac. Vote mechanisms and solution of inequation systems with real variables. Computational Complexity [cs.CC]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG045⟩. ⟨tel-05300167⟩
Tianjiao Dai, Qiancheng Ouyang, François Pirot. New Bounds for Odd Colourings of Graphs. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.57. ⟨10.37236/12110⟩. ⟨hal-05246159⟩
Olivier Bournez, Johanne Cohen, Adrian Wurm. A Universal Uniform Approximation Theorem for Neural Networks. 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Varsovie, Poland. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, ⟨10.4230/LIPIcs.MFCS.2025.29⟩. ⟨hal-05241833⟩
Manon Blanc. Discrete-Time and Continuous-Time Systems over the Reals : Relating Complexity with Robustness, Length and Precision. Computational Complexity [cs.CC]. Institut Polytechnique de Paris, 2025. English. ⟨NNT : 2025IPPAX024⟩. ⟨tel-05118950⟩