Pages that link to "Item:Q2255227"
From MaRDI portal
The following pages link to Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227):
Displaying 4 items.
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)