On miniaturized problems in parameterized complexity theory (Q820145): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jörg Flum / 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.tcs.2005.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165019867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear FPT reductions and computational lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:50, 24 June 2024

scientific article
Language Label Description Also known as
English
On miniaturized problems in parameterized complexity theory
scientific article

    Statements

    On miniaturized problems in parameterized complexity theory (English)
    0 references
    0 references
    0 references
    6 April 2006
    0 references
    parameterized complexity
    0 references
    subexponential algorithms
    0 references
    Fagin-definability
    0 references

    Identifiers