Fixed-parameter decidability: extending parameterized complexity analysis
From MaRDI portal
Recommendations
Cites work
- A note on bi-immunity and p-closeness of p-cheatable sets in P/poly
- Algorithmic randomness and complexity.
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3342831 (Why is no real title available?)
- Instance complexity
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Limiting recursion
- On degrees of unsolvability
- On miniaturized problems in parameterized complexity theory
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
- Random strings make hard instances
- Semirecursive Sets and Positive Reducibility
- Theory of semi-feasible algorithms
- Trial and error predicates and the solution to a problem of Mostowski
- Weakly computable real numbers
Cited in
(3)
This page was built for publication: Fixed-parameter decidability: extending parameterized complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958220)