Pages that link to "Item:Q4007852"
From MaRDI portal
The following pages link to ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852):
Displaying 18 items.
- Improving known solutions is hard (Q687508) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Ancestors, descendants, and gardens of Eden in reaction systems (Q896703) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- On complexity of a global optimization problem (Q928586) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- The computational complexity of maximization and integration (Q1057267) (← links)
- Area-time complexity of the unconstrained minimization problem (Q1087137) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- A computing experiment in the problem of optimization of computations. I (Q1968507) (← links)
- Preimage Problems for Reaction Systems (Q2799204) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- (Q3161327) (← links)
- (Q3359762) (← links)
- (Q4780111) (← links)
- (Q4852904) (← links)
- (Q5421701) (← links)