Pages that link to "Item:Q5111186"
From MaRDI portal
The following pages link to Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. (Q5111186):
Displaying 10 items.
- Quantifier rank for parity of embedded finite models. (Q1401237) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- (Q5009475) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)
- On the Descriptive Complexity of Color Coding (Q5090457) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
