|
|
Автор: Jesse Russell
Год: 2013
Издание:
Книга по Требованию
Страниц: 100
ISBN: 9785508635749
High Quality Content by WIKIPEDIA articles! 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 and vertex 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 Stal Aanderaa, Richard M. Karp, and Arnold L. Rosenberg. According to the conjecture, for a wide class of properties, no algorithm can guarantee that it will be able to skip any questions: any algorithm for determining whether the graph has the property, no matter how clever, might need to examine every pair of vertices before it can give its answer. A property satisfying this conjecture is called evasive. Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в среде Интернет в...
|
|
