Reproducibility and Pseudo-Determinism in Log-Space
From MaRDI portal
Publication:5236219
DOI10.1137/1.9781611975482.38zbMath1431.68138arXiv1803.04025OpenAlexW2793253595MaRDI QIDQ5236219
No author found.
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04025
Related Items (2)
On Pseudodeterministic Approximation Algorithms. ⋮ Planar Maximum Matching: Towards a Parallel Algorithm
This page was built for publication: Reproducibility and Pseudo-Determinism in Log-Space