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)

Related topics

Related topics

9 relations
Bit arrayBlack boxComputational group theoryImplicit graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Black box, white arrow Borovik, Alexandre and Yalcinkaya, Sukru 2014
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory… 
2015
2015
Alternative models for quantum computation
We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that… 
2015
2015
Alternative models for quantumcomputation
We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that… 
2014
2014
Black Box White Arrow
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory… 
2013
2013
FIFTY SHADES OF BLACK
The paper proposes a new and systematic approach to the so- called black box group methods in computational group theory. As the… 
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… 
2013
2013
A note on computing involution centralizers
Review
2001
Review
2001
Contemporary Mathematics Centralisers of Involutions in Black Box Groups
We discuss basic structural properties of finite black box groups. A special emphasis is made on the use of centralisers of… 
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… 
Highly Cited
1992
Highly Cited
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)