scientific article; zbMATH DE number 1222098
From MaRDI portal
Publication:4217593
zbMath0918.68018MaRDI QIDQ4217593
Udayan Taylor, Michael R. Fellows, Rodney G. Downey
Publication date: 17 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (18)
Describing parameterized complexity classes ⋮ Enumeration for FO Queries over Nowhere Dense Graphs ⋮ An existential locality theorem ⋮ FO model checking on geometric graphs ⋮ The Birth and Early Years of Parameterized Complexity ⋮ Surfing with Rod ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ W-hierarchies defined by symmetric gates ⋮ Machine-based methods in parameterized complexity theory ⋮ The complexity of nonrepetitive coloring ⋮ Unnamed Item ⋮ A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties ⋮ Threshold dominating sets and an improved characterization of \(W[2\)] ⋮ Unnamed Item ⋮ Parameterized Complexity ⋮ On the Parameterized Complexity of Contraction to Generalization of Trees. ⋮ On the complexity of database queries ⋮ Fixed-parameter complexity in AI and nonmonotonic reasoning
This page was built for publication:
