Solving large FPT problems on coarse-grained parallel machines (Q1877701): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved fixed-parameter algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Coarse-grained parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank

Latest revision as of 19:09, 6 June 2024

scientific article
Language Label Description Also known as
English
Solving large FPT problems on coarse-grained parallel machines
scientific article

    Statements

    Identifiers