Computational complexity and local algorithms. On the interplay between randomness and computation

DOI10.1007/978-3-031-88946-2MaRDI QIDQ6945401zbMATH OpenFDO

Authors

Publication date 8 August 2025

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cited in

(2)

• On testing isomorphism to a fixed graph in the bounded-degree graph model
• Robust self-ordering versus local self-ordering

This page was built for publication: Computational complexity and local algorithms. On the interplay between randomness and computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945401)