Complexity of fixed point counting problems in Boolean networks F Bridoux, A Durbec, K Perrot, A Richard Journal of Computer and System Sciences 126, 138-164, 2022 | 11 | 2022 |
Complexity of maximum fixed point problem in Boolean networks F Bridoux, N Durbec, K Perrot, A Richard Conference on Computability in Europe, 132-143, 2019 | 10 | 2019 |
Reversibility vs Local Creation/Destruction P Arrighi, N Durbec, A Emmanuel Reversible Computation: 11th International Conference, RC 2019, Lausanne …, 2019 | 8 | 2019 |
Quantum superpositions of graphs P Arrighi, M Christodoulou, A Durbec arXiv preprint arXiv:2010.13579, 2020 | 7 | 2020 |
Quantum networks theory P Arrighi, A Durbec, M Wilson arXiv preprint arXiv:2110.10587, 2021 | 6 | 2021 |
On quantum superpositions of graphs, no-signalling and covariance P Arrighi, M Christodoulou, A Durbec arXiv preprint arXiv:2010.13579, 2020 | 4 | 2020 |
Graph subshifts P Arrighi, A Durbec, P Guillon Conference on Computability in Europe, 261-274, 2023 | 2 | 2023 |
A toy model provably featuring an arrow of time without past hypothesis P Arrighi, G Dowek, A Durbec International Conference on Reversible Computation, 50-68, 2024 | | 2024 |
Generalised tensors and traces P Arrighi, A Durbec, M Wilson arXiv preprint arXiv:2202.11340, 2022 | | 2022 |