Reinhold Burger. Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem. In Marc Moreno Maza, Lihong Zhi, editors, ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022. pages 391-398, ACM, 2022. [doi]
@inproceedings{Burger22,
title = {Enumerating Denumerable Sets in Polynomial Time via the Schröder-Bernstein Theorem},
author = {Reinhold Burger},
year = {2022},
doi = {10.1145/3476446.3535479},
url = {https://doi.org/10.1145/3476446.3535479},
researchr = {https://researchr.org/publication/Burger22},
cites = {0},
citedby = {0},
pages = {391-398},
booktitle = {ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022},
editor = {Marc Moreno Maza and Lihong Zhi},
publisher = {ACM},
isbn = {978-1-4503-8688-3},
}