2006•Journal of Combinatorial OptimizationRequires access

On the computational hardness based on linear FPT-reductions

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Open publisher page 33 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 33 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Parameterized complexity, Hierarchy, Theory of computation, Computational complexity theory, Reduction (mathematics), Mathematics, Structural complexity, Time complexity

Back to paper search Browse research topics Original source

On the computational hardness based on linear FPT-reductions — Research Paper | ScholarLens