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… CONTINUE READING
    Deciding finiteness of matrix groups in Las Vegas polynomial time
    • L. Babai
    • Mathematics, Computer Science
    • 1992
    • 11
    Probabilistic checking of proofs: a new characterization of NP
    • 729
    • PDF
    Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
    • K. Ko
    • Computer Science, Mathematics
    • 1990
    • 14
    On derandomizing algorithms that err extremely rarely
    • 16
    • PDF
    Essentially optimal interactive certificates in linear algebra
    • 13
    • PDF
    Polynomial-time theory of matrix groups
    • 40
    • PDF
    Succinct quantum proofs for properties of finite groups
    • 160
    • PDF
    Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
    • 1,270
    • PDF
    Some facets of complexity theory and cryptography: A five-lecture tutorial
    • J. Rothe
    • Computer Science, Mathematics
    • 2002
    • 24
    • PDF
    Unknotting is in AM ∩ co-AM
    • 7