References a rank function in GAP.

parameterized/parawnc.tex

@@ -186,7 +186,8 @@ \subsubsection{Small generating set problems}
 % Why is this relevant to the reader, and why does something need to be done?
 % (Also reference relevant existing work.)
 %
-The group rank problem, a restricted version of the semigroup rank problem, is equally, if not more, useful in applications, so we would like to understand the parameterized complexity of that problem as well.
+The group rank problem, a restricted version of the semigroup rank problem, is useful in applications and generally lacks an efficient implementation, so we would like to understand the parameterized complexity of that problem as well.
+For example, at the time of this publication, the popular computational discrete algebra software package \textsc{gap} \autocite{gap} includes a function \texttt{RankPGroup} that computes the rank of a $p$-group but lacks a function that computes the rank of a general finite group.
 
 \begin{definition}[$\pgrouprank$]
   \mbox{} \\

parameterized/references.bib

@@ -256,3 +256,10 @@ @article{hastad01
  pages = {798--859},
  doi = {10.1145/502090.502098},
 }
+
+@manual{gap,
+  organization = {The GAP~Group},
+  title = {GAP --- Groups, Algorithms, and Programming, Version 4.8.6},
+  year = 2016,
+  url = {http://www.gap-system.org},
+}