The Number of Classes of Invertible Boolean Functions
Journal of the ACM (JACM)
Experience with test generation for real protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
A complete formulation of generalized affine equivalence
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
| Hi-index | 0.00 |
Formulas and algorithms have recently been given for calculating the number of symmetry types of functions, networks and automata under various transformation groups. In almost all cases, the computations involved are quite difficult and require the use of a digital computer. In this paper, asymptotic estimates are given for these numbers, which are trivial to compute and which are very accurate in most cases even for small values of the parameters.