Bounded fixed-parameter tractability and reducibility (Q2382273): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q494055 / rank
Normal rank
 
Property / author
 
Property / author: Jörg Flum / rank
Normal rank
 
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / author
 
Property / author: Jörg Flum / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2007.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094650442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fixed-parameter tractability and approximability of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Amount of Nondeterminism and the Power of Verifying / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of parameterized problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-based methods in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank

Latest revision as of 10:22, 27 June 2024

scientific article
Language Label Description Also known as
English
Bounded fixed-parameter tractability and reducibility
scientific article

    Statements

    Bounded fixed-parameter tractability and reducibility (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 September 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity theory
    0 references
    reductions
    0 references
    0 references