Pages that link to "Item:Q5310633"
From MaRDI portal
The following pages link to Model-Checking Problems as a Basis for Parameterized Intractability (Q5310633):
Displaying 6 items.
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
