Pages that link to "Item:Q1898460"
From MaRDI portal
The following pages link to Complexity classes of optimization functions (Q1898460):
Displayed 9 items.
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- On the Complexity of Inverse Mixed Integer Linear Optimization (Q5013588) (← links)
- The operators min and max on the polynomial hierarchy (Q5047162) (← links)
- THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
- ON HIGHER ARTHUR-MERLIN CLASSES (Q5696962) (← links)