Export Citations
1 Results for: Keyword: Hardness in P
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,766,528 records)|Limit your search to The ACM Full-Text Collection (759,342 records)
- research-articleJune 2019
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
ACM Transactions on Algorithms (TALG), Volume 15, Issue 3Article No.: 33, Pages 1–57https://doi.org/10.1145/3310228Recently, hardness results for problems in P were achieved using reasonable complexity-theoretic assumptions such as the Strong Exponential Time Hypothesis. According to these assumptions, many graph-theoretic problems do not admit truly subquadratic ...