Skip to main navigation Skip to search Skip to main content

On the computational hardness based on linear FPT-reductions

  • Texas A and M University
  • Central South University
  • Arkansas State University
  • Lafayette College

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)231-247
Number of pages17
JournalJournal of Combinatorial Optimization
Volume11
Issue number2
DOIs
StatePublished - Mar 2006

ASJC Scopus Subject Areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Keywords

  • Complexity
  • FPT-reduction
  • Hardness
  • Linear

Cite this