Journal of Algebra · 2003 · 189 citations · 32 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDecision TheoryProbability TheoryComplexity TheoryComputational ComplexityGroup TheoryProbabilistic CombinatoricsRandom WalksStructural ComplexityAverage-case ComplexityDecision ProblemsExponential Time ComplexityPolynomial Time ComplexityProbabilistic Complexity ClassesRandom Walks On GroupsWorst-case Complexity
32
Free subgroups in linear groups
Jacques Tits · Journal of Algebra · 1972 · 880 citations
Gian‐Carlo Rota · Advances in Mathematics · 1978 · 866 citations
HOW GOOD IS THE SIMPLEX ALGORITHM
Victor Klee, George J. Minty · 1970 · 784 citations
Average Case Complete Problems
Leonid A. Levin · SIAM Journal on Computing · 1986 · 431 citations