Pages that link to "Item:Q4635628"
From MaRDI portal
The following pages link to Achieving new upper bounds for the hypergraph duality problem through logic (Q4635628):
Displaying 7 items.
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← 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)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- Fundamentals of Computation Theory (Q5900817) (← links)
