Pages that link to "Item:Q2483826"
From MaRDI portal
The following pages link to Sources of complexity in subset choice (Q2483826):
Displaying 7 items.
- Binary interactions and subset choice (Q1268247) (← links)
- Parameterized complexity of theory of mind reasoning in dynamic epistemic logic (Q1711514) (← links)
- Intractability and approximation of optimization theories of cognition (Q2438604) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- A characterization of the existence of succinct linear representation of subset-valuations (Q6167805) (← links)