Pages that link to "Item:Q2404077"
From MaRDI portal
The following pages link to A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077):
Displaying 5 items.
- On the complexity of the clone membership problem (Q2048213) (← links)
- Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
