Pages that link to "Item:Q5055917"
From MaRDI portal
The following pages link to The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917):
Displaying 5 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Solving conflicts in information merging by a flexible interpretation of atomic propositions (Q650523) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- (Q4553280) (← links)
