Black box group
In computational group theory, a black box group (black-box group) is a group G whose elements are encoded by bit strings of length N, and group operations are performed by an oracle (the "black box").
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computational group theory, a black box group (black-box group) is a group G whose elements are encoded by bit strings of length N, and group operations are performed by an oracle (the "black box"). These operations include: * taking a product g·h of elements g and h, * taking an inverse g −1 of element g, * deciding whether g = 1.
This class is defined to include both the permutation groups and the matrix groups. The upper bound on the order of G given by |G| ≤ 2 N shows that G is finite.
In computational group theory, a black box group (black-box group) is a group G whose elements are encoded by bit strings of length N, and group operations are performed by an oracle (the "black box"). These operations include: taking a product g·h of elements g and h, taking an inverse g −1 of element g, deciding whether g = 1.
This class is defined to include both the permutation groups and the matrix groups. The upper bound on the order of G given by |G| ≤ 2 N shows that G is finite.
See also
Implicit graph Matroid oracle
Text derived from https://en.wikipedia.org/w/index.php?oldid=1241281579 under CC BY-SA 4.0; modifications have been made.