Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We introduce a new approach in black box group theory which deals with black box group problems in the category of black boxes… 
2014
2014
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory… 
2013
2013
2013
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for… 
2007
2007
We propose a uniform approach for recognizing all black box groups of Lie type which is based on the analysis of the structure of… 
Highly Cited
2007
Highly Cited
2007
Abstract.In a connected group of finite Morley rank, if the Sylow 2-subgroups are finite then they are trivial. The proof… 
2003
2003
In this paper, the author presents a new algorithm to recognise, constructively, when a given black-box group is a homomorphic… 
2000
2000
The well-known Goldbach Conjecture (GC) states that any sufficiently large even number can be represented as a sum of two odd… 
1995
1995
A Monte Carlo algorithm is presented for constructing the natural representation of a group G that is known to be isomorphic to… 
Highly Cited
1984
Highly Cited
1984
We build a theory of black box groups, and apply it to matrix groups over finite fields. Elements of a black box group are…