“…However, as said above, for our purposes the size is not enough: We need explicit cocycles representing the elements of
. Moreover, the explicit results of [
17] and [
18] for connected reductive
‐groups, and the less explicit results of [
14] for quasi‐connected reductive
‐groups, are not enough either: we need to be able to compute
for linear algebraic groups that are not necessarily reductive, or connected, or quasi‐connected. In this paper, we give algorithms, implemented on computer, to determine the Galois cohomology set of an arbitrary real linear algebraic group.…”