Parameterized Complexity and Subexponential-Time Computability (Q2908538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved deterministic local search algorithm for 3-SAT / 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: Circuit Bottom Fan-in and Computational Power / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of polynomial-time approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing parallel hierarchies by reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic algorithms for weighted matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes and parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parameterized exponential time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Isomorphism Between Subexponential and Parameterized Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Design of Drugs Without Side-Effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 16:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Complexity and Subexponential-Time Computability
scientific article

    Statements

    Parameterized Complexity and Subexponential-Time Computability (English)
    0 references
    5 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references