Computing in permutation groups without memory
From MaRDI portal
Publication:5173197
DOI10.4086/cjtcs.2014.007zbMath1319.68090arXiv1310.6008MaRDI QIDQ5173197
Peter J. Cameron, Ben T. Fairbairn, Maxmilien Gadouleau
Publication date: 9 February 2015
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6008
permutation groups; generating sets; symmetric group; alternating group; Boolean networks; memoryless computation; sequential updates
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
20B99: Permutation groups