benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10450 / Let G = (V, E) be a connected, undirected graph, and let a and b be two distinct…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Let G = (V, E) be a connected, undirected graph, and let a and b be two distinct vertices in V. Let P_1 be the problem of finding a shortest simple path between a and b, and let P_2 be the problem of finding a longest simple path between a and b. Which of the following statements about P_1 and P_2 is true?

category

computer science

options

  1. Both P_1 and P_2 are known to not be solvable in polynomial time.
  2. Both P_1 and P_2 can be solved in polynomial time.
  3. P_1 is not known to be solvable in polynomial time but P_2 can be solved in polynomial time.
  4. P_2 can be solved in polynomial time and P_1 is known to not be solvable in polynomial time.
  5. P_2 can be solved in polynomial time but P_1 is not known to be solvable in polynomial time.
  6. It is known that either P_1 or P_2 can be solved in polynomial time.
  7. P_1 can be solved in polynomial time but P_2 is not known to be solvable in polynomial time.
  8. It is not known whether either P_1 or P_2 can be solved in polynomial time.
  9. P_1 is known to not be solvable in polynomial time but P_2 can be solved in polynomial time.
  10. P_1 can be solved in polynomial time and P_2 is known to not be solvable in polynomial time.

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10450
task_id
dd96c839-d928-58b6-8ae0-5388833a22d3
task_key
default--test--10450
task_revision_id
1
config / split
default / test

Official source

initial import