Sciweavers

53 search results - page 3 / 11
» Constructive homomorphisms for classical groups
Sort
View
LICS
2000
IEEE
13 years 12 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
TOC
2008
122views more  TOC 2008»
13 years 7 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
JCT
2008
84views more  JCT 2008»
13 years 7 months ago
Fix-Mahonian Calculus, II: Further statistics
Using classical transformations on the symmetric group and two transformations constructed in Fix-Mahonian Calculus I, we show that several multivariable statistics are equidistrib...
Dominique Foata, Guo-Niu Han
ICCS
2004
Springer
14 years 27 days ago
Graphical and Computational Representation of Groups
An important part of the computer science is focused on the links that can be established between group theory and graph theory. Cayley graphs can establish such a link but meet so...
Alain Bretto, Luc Gillibert
FOCS
2000
IEEE
13 years 11 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous