Complexity of decision problem to decide if permutation group is $k$-transitive Given a finite permutation group $G$ (a subgroup of the symmetric group on a finite set) in terms of its generators, what is known about the decision problem of deciding if $G$ is $k$-transitive for a given $k \ge 1$?
What can we say about the complexity of this problem, and in what complexity class is it contained?
 A: There have been several articles on this forum discussing these topics, but here is a quick review.
A base $B$ for a subgroup $G \le {\rm Sym}(X)$ is a sequence $(\alpha_1,\ldots,\alpha_k)$ of points in $X$, such that the stabilizer $G_B$ of the sequence (i.e. the intersections of the stabilizers of the $\alpha_i$) is trivial.
For $1 \le i \le k+1$, let $G^{(i)}$ denote the stabilizer of the initial subsequence $(\alpha_1,\ldots,\alpha_{i-1})$ of $B$ (so $G^{(1)}=G$ and $G^{(k+1)} = G_B = 1$).
An strong generating set of $G$ w.r.t $B$ is a generating set that includes generators of each of the subgroup $G^{(i)}$.
Given a strong generating set, we can easily calculate the basic orbits, which are the orbits of $\alpha_i$ under $G_i$ for $1 \le i \le k$, and the order of $G$ is  the product of the lengths of the basic orbits. In particular, $G$ is $k$-transitive if and only if the sequence of basic orbit lengths starts $n,n-1,\ldots,n-k+1$ where $n=|X|$.
The Schreier-Sims algorithm computes a base and strong generating set for $G$ in polynomial time, given an arbitrary generating set as input. There are many heuristics and tricks that can be used to speed it up in certain situations, and some of these were used  by Sims (who sadly died recently) in his proofs of the existence of some of the sporadic finite simple groups.
Incidentally, the O'Nan simple group, which arises as a subgroup of $S_{122760}$ is the only remaining sporaic group for which no computer-free existence proof has been found. Its existence can now be proved using versions of this algorithm in a few seconds on a laptop.
See the Wikipedia article for morec details and references.
A: To check $k$-transitivity of an action of a finite group $G=\langle g_1,...,g_n\rangle$ on a finite set $X$ consider the graph $\Gamma$ where vertices are $k$-tuples of distinct elements of $X$ and edges are $(v, g_i\cdot v)$.  The action is $k$-transitive if and only if the graph $\Gamma$ is connected. Since checking connectedness of a graph is in $P$, and the number of vertices of $\Gamma$ is $\le |X|^k$, your problem is in $P$. 
