Realizing complex boolean functions with simple groups
From MaRDI portal
Cited in
(6)- John Rhodes and the theory of finite semigroups.
- An automaton group with \textsf{PSPACE}-complete word problem
- Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions
- Interleaved Group Products
- Length of polynomials over finite groups
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
This page was built for publication: Realizing complex boolean functions with simple groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5599841)