Boolean Functions, Invariance Groups, and Parallel Complexity
From MaRDI portal
Recommendations
- Symmetry groups of Boolean functions.
- On the representation of the inertia group of Boolean functions in a symmetric group
- scientific article; zbMATH DE number 709442
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Equivalence classes of invertible Boolean functions
Cited in
(20)- Almost all Boolean functions have no linear symmetries
- Symmetry groups of Boolean functions and constructions of permutation groups
- On generalized \(P\)-reducible Finsler manifolds
- Cut approach to invariance groups of lattice-valued functions
- Labeled versus unlabeled distributed Cayley networks
- Invariance groups of functions and related Galois connections
- Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\)
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Cyclic permutation groups that are automorphism groups of graphs
- On symmetric circuits and fixed-point logics
- Linear symmetries of Boolean functions.
- Isomorphism testing of read-once functions and polynomials
- Symmetry groups of Boolean functions.
- scientific article; zbMATH DE number 1379307 (Why is no real title available?)
- Partially symmetric functions are efficiently isomorphism testable
- Wreath product in automorphism groups of graphs
- Orbit closed permutation groups, relation groups, and simple groups
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- Symmetry groups for social preference functions
- Regular symmetric groups of Boolean functions.
This page was built for publication: Boolean Functions, Invariance Groups, and Parallel Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3361880)
