Pages that link to "Item:Q1152218"

The following pages link to Optimization problems and the polynomial hierarchy (Q1152218):

Displaying 9 items.

• On the complexity of test case generation for NP-hard problems (Q917311) (← links)
• The complexity of facets (and some facets of complexity) (Q1061485) (← links)
• Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
• Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• On the Stackelberg knapsack game (Q2029942) (← links)
• Comparison of metaheuristics for the bilevel facility location and mill pricing problem (Q3186830) (← links)
• The difference and truth-table hierarchies for NP (Q3783278) (← links)
• On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies (Q4973243) (← links)