nayana-c1.867c992ae9100904cc61c84591adf0f8f863e0387e30f0d0dbc86640e9f50a1a.en.train.292264
nayana-c1.867c992ae9100904cc61c84591adf0f8f863e0387e30f0d0dbc86640e9f50a1a.en.train.292264: train task in FineEnvs/nayana-ocr-env, an RL environment on the Hugging Face Hub. Which of the following best describes the relationship between the maximum s-t flow problem and the minimum capacity s-t cut…
The task
Which of the following best describes the relationship between the maximum s-t flow problem and the minimum capacity s-t cut problem? A. They are independent problems. B. They constitute a strong dual pair. C. They are equivalent to the primal problem. D. They have no optimal solution. Return only the single uppercase letter of the correct option.
Task details
- language
- en
- family
- mcq_vqa
- mime
- image/jpeg
- media ready
- False