On some FPT problems without polynomial Turing compressions
Work
Year: 2021
Type: article
Source: Theoretical Computer Science
Author Weidong Luo
Institutions Central South University, Humboldt-Universität zu Berlin
Cites: 40
Cited by: 2
Related to: 10
FWCI: 0.259
Citation percentile (by year/subfield): 34.23
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
Funder China Scholarship Council
Grant ID 201708430114