On computability and tractability for infinite sets
From MaRDI portal
Publication:5145286
DOI10.1145/3209108.3209190zbMath1452.03093OpenAlexW2798653279MaRDI QIDQ5145286
Szymon Toruńczyk, Mikołaj Bojańczyk
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209108.3209190
Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items