Pages that link to "Item:Q1193867"

The following pages link to Generalizations of Opt P to the polynomial hierarchy (Q1193867):

Displaying 13 items.

• Complexity of counting the optimal solutions (Q837174) (← links)
• Counting complexity of propositional abduction (Q988576) (← links)
• The complexity of optimization problems (Q1107309) (← links)
• Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
• Complexity of Counting the Optimal Solutions (Q3511323) (← links)
• Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
• (Q4553280) (← links)
• The operators min and max on the polynomial hierarchy (Q5047162) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• THE OPERATORS MIN AND MAX ON THE POLYNOMIAL HIERARCHY (Q5249042) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)