Describing parameterized complexity classes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1688350 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 1222098 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- scientific article; zbMATH DE number 1114020 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1453052 (Why is no real title available?)
- Advice classes of parametrized tractability
- Computer Science Logic
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Fixed-parameter tractability, definability, and model-checking
- Languages that Capture Complexity Classes
- Relational queries computable in polynomial time
- Resolution Is Not Automatizable Unless W[P] Is Tractable
- Weak Second‐Order Arithmetic and Finite Automata
- When is the evaluation of conjunctive queries tractable?
Cited in
(30)- Parameterized complexity results for a model of theory of mind based on dynamic epistemic logic
- A parameterized halting problem, _0 truth and the MRDP theorem
- Strong backdoors for default logic
- Strong Backdoors for Default Logic
- Parameterised counting in logspace
- Backdoors to planning
- The parameterized complexity of maximality and minimality problems
- Counting Small Induced Subgraphs with Hereditary Properties
- Parameterised counting in logspace
- A multiparametric view on answer set programming
- On the parallel parameterized complexity of MaxSAT variants
- Semantic tree-width and path-width of conjunctive regular path queries
- The parameterized space complexity of model-checking bounded variable first-order logic
- On the space and circuit complexity of parameterized problems: classes and completeness
- scientific article; zbMATH DE number 2086399 (Why is no real title available?)
- Strong backdoors for default logic
- Parameterized Complexity Classes under Logical Reductions
- On parameterized complexity of the multi-MCS problem
- Parameterized bounded-depth Frege is not optimal
- scientific article; zbMATH DE number 1424025 (Why is no real title available?)
- On the descriptive complexity of color coding
- Parameterized Complexity Results for 1-safe Petri Nets
- Inductive Logic Programming
- Parameterized Parallel Computing and First-Order Logic
- On the equivalence among problems of bounded width
- Parameterized complexity classes beyond para-NP
- Backdoors to normality for disjunctive logic programs
- The parameterized space complexity of embedding along a path
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\)
- Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
This page was built for publication: Describing parameterized complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877556)
