Trading group theory for randomness

  title={Trading group theory for randomness},
  author={L. Babai},
  booktitle={STOC '85},
  • L. Babai
  • Published in STOC '85 1985
  • Mathematics, Computer Science
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… Expand
Deciding finiteness of matrix groups in Las Vegas polynomial time
  • L. Babai
  • Mathematics, Computer Science
  • SODA '92
  • 1992
Probabilistic checking of proofs: a new characterization of NP
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
  • K. Ko
  • Mathematics, Computer Science
  • JACM
  • 1990
Essentially optimal interactive certificates in linear algebra
Unknotting is in AM ∩ co-AM
Polynomial-time theory of matrix groups
New (and Old) Proof Systems for Lattice Problems
Some facets of complexity theory and cryptography: A five-lecture tutorial
  • J. Rothe
  • Mathematics, Computer Science
  • CSUR
  • 2002
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
  • F. Gall
  • Mathematics, Computer Science
  • 2010
On the communication complexity of zero-knowledge proofs