Aanderaa–Karp–Rosenberg conjecture

In theoretical computer science, the Aanderaa–Karp–Rosenberg conjecture (also known as the Aanderaa–Rosenberg conjecture or the evasiveness conjecture) is a group of related conjectures about the number of questions of the form "Is there an edge between vertex u {\displaystyle u} and vertex v {\displaystyle v} ? " that have to be answered to determine whether or not an undirected graph has a particular property such as planarity or bipartiteness. They are named after Stål Aanderaa, Richard M. Karp, and Arnold L. Rosenberg.

Source: Wikipedia — Aanderaa–Karp–Rosenberg conjecture (CC BY-SA 4.0)

Aanderaa–Karp–Rosenberg conjecture

In theoretical computer science, the Aanderaa–Karp–Rosenberg conjecture (also known as the Aanderaa–Rosenberg conjecture or the evasiveness conjecture) is a group of related conjectures about the number of questions of the form "Is there an edge between vertex u {\displaystyle u} and vertex v {\displaystyle v} ? " that have to be answered to determine whether or not an undirected graph has a particular property such as planarity or bipartiteness. They are named after Stål Aanderaa, Richard M. Karp, and Arnold L. Rosenberg.

This neuron ends here.

Source: Wikipedia "Aanderaa–Karp–Rosenberg conjecture" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy