On some FPT problems without polynomial Turing compressions

From MaRDI portal
Publication:2072079

DOI10.1016/j.tcs.2021.12.017OpenAlexW4200338129MaRDI QIDQ2072079

Weidong Luo

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.12.017





Cites Work