Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

9 relations
Bit arrayBlack boxComputational group theoryImplicit graph
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Adjoint representations of black box groups PSL2(Fq)
Abstract Given a black box group Y encrypting PSL 2 ( F ) over an unknown field F of unknown odd characteristic p and a global… Expand
Is this relevant?
2014
2014
New Approaches in Black Box Group Theory
We introduce a new approach in black box group theory which deals with black box group problems in the category of black boxes… Expand
Is this relevant?
2013
2013
Classical and Quantum Algorithms for Testing Equivalence of Group Extensions
While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for… Expand
  • figure 1
Is this relevant?
2008
2008
Fast constructive recognition of black box symplectic groups
We present an algorithm which, for any given black box group G isomorphic to Sp(d,q), constructs explicit inverse isomorphisms… Expand
  • table 1
  • table 2
Is this relevant?
2007
2007
Black Box Groups
We propose a uniform approach for recognizing all black box groups of Lie type which is based on the analysis of the structure of… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
2007
2007
Involutions in groups of finite Morley rank of degenerate type
Abstract.In a connected group of finite Morley rank, if the Sylow 2-subgroups are finite then they are trivial. The proof… Expand
Is this relevant?
2003
2003
Fast Constructive Recognition of Black-Box Unitary Groups
In this paper, the author presents a new algorithm to recognise, constructively, when a given black-box group is a homomorphic… Expand
Is this relevant?
2000
2000
Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture
The well-known Goldbach Conjecture (GC) states that any sufficiently large even number can be represented as a sum of two odd… Expand
  • table 2
  • table 3
  • figure 1
Is this relevant?
1995
1995
Constructive recognition of a black box group isomorphic to GL(n,2)
A Monte Carlo algorithm is presented for constructing the natural representation of a group G that is known to be isomorphic to… Expand
Is this relevant?
1992
1992
Bounded Round Interactive Proofs in Finite Groups
This paper considers “black box groups,” i.e., finite groups whose elements are uniquely encoded by strings of uniform length… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE