Corpus ID: 42571902

Trading Group Theory for Randomness La ’ siszld

  title={Trading Group Theory for Randomness La ’ siszld},
  author={La’siszld Babai},
la a previous paper [BS] we proved, using the elements of the Clwory of nilyotenf yroupu, that some of the /undamcnla1 computational problems in mat& proup, belong to NP. These problems were also ahown to belong to CONP, assuming an unproven hypofhedi.9 concerning finilc simple Q’ oup,. The aim of this paper is t.o replace most of the (proven and unproven) group theory of IBS] by elementary combinatorial argumenls. The rev& we prove is that relative to a random oracle f3, tbc meutioned matrix… Expand
4 Citations
S p 2 ⊆ ZPP NP
We show that the class Sp 2 is a subclass of ZPP. The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that theExpand
UvA-DARE ( Digital Academic Repository ) Cryptography in a quantum world
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons.Expand
Stronger methods of making quantum interactive proofs perfectly complete
It is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. Expand
SIGACT news complexity theory column 64
It is proposed that every infinite NPcomplete set splits by a set in P into two disjoint, infinite NP-complete set. Expand


On the Complexity of Matrix Group Problems I
A theory of black box groups is built, and it is proved that for such subgroups, membership and divisor of the order are in NPB, and under a plausible mathematical hypothesis on short presentations of finite simple groups, nom membership and exaact order will also be inNPB. Expand
Explicit Constructions of Linear-Sized Superconcentrators
A direct way to construct a family of l inear concentrators using Pinsker’s linear concentrators and disproved a conjecture that superconcentrators require more than a linear number of edges. Expand
Computational complexity and the classification of finite simple groups
  • L. Babai, W. Kantor, E. Luks
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
It appears that unless there is another radical breakthrough in ISO, independent of the previous one, the simple groups classification is an indispensable tool for further developments. Expand
Universal Classes of Hash Functions
An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions. Expand
A Fast Monte-Carlo Test for Primality
A uniform distribution a from a uniform distribution on the set 1, 2, 3, 4, 5 is a random number and if a and n are relatively prime, compute the residue varepsilon. Expand
Computational complexity of probabilistic Turing machines
It is shown how probabilisticlinear-bounded automata can simulate nondeterministic linear-bounding automata and an example is given of a function computable more quickly by Probabilistic Turing machines than by deterministic Turing machines. Expand
The knowledge complexity of interactive protocols
  • in: Proc. 17th ACM Symp. Theory of Comp.,
  • 1985
Lautrmann, E/‘/J and thr polynomial hierarchy, info
  • Proc. Lett,crs 17,
  • 1983
ErdGs, Representation of group c!ement,s as short products, in: Theory ant! Practice of Combinatorics (A
  • Rosa et a!. eds.), Annals of Discr. Math
  • 1982
Relative to a random oracle A, P’c#NP’#coNP
  • SIAM J. Comp
  • 1981