Pages that link to "Item:Q1625182"
From MaRDI portal
The following pages link to On strong NP-completeness of rational problems (Q1625182):
Displaying 6 items.
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- (Q5039187) (← links)
- Coordination Games on Weighted Directed Graphs (Q5085129) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)