# Trading group theory for randomness

@inproceedings{Babai1985TradingGT, title={Trading group theory for randomness}, author={L. Babai}, booktitle={STOC '85}, year={1985} }

In a previous paper [BS] we proved, using the elements of the theory of <italic>nilpotent groups</italic>, that some of the <italic>fundamental computational problems in matriz groups</italic> belong to <italic>NP</italic>. These problems were also shown to belong to <italic>coNP</italic>, assuming an <italic>unproven hypothesis</italic> concerning <italic>finite simple groups</italic>.
The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary… CONTINUE READING

#### Topics from this paper.

#### Paper Mentions

BLOG POST

BLOG POST

760 Citations

Deciding finiteness of matrix groups in Las Vegas polynomial time

- Mathematics, Computer Science
- 1992

- 11

Probabilistic checking of proofs: a new characterization of NP

- Computer Science, Mathematics
- 1998

- 729
- PDF

Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy

- Computer Science, Mathematics
- 1990

- 14

Essentially optimal interactive certificates in linear algebra

- Computer Science, Mathematics
- 2014

- 13
- PDF

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

- Computer Science, Mathematics
- 1991

- 1,270
- PDF

Some facets of complexity theory and cryptography: A five-lecture tutorial

- Computer Science, Mathematics
- 2002

- 24
- PDF