Hypergraph isomorphism and structural equivalence of Boolean functions

DOI10.1145/301250.301427zbMath1345.68176OpenAlexW2125057414MaRDI QIDQ2819594

Eugene M. Luks

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301427

Mathematics Subject Classification ID

Related Items (10)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Cooperation through social influence ⋮ The parameterized complexity of geometric graph isomorphism ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ Isomorphism testing of Boolean functions computable by constant-depth circuits ⋮ Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Complexity classes of equivalence problems revisited ⋮ Isomorphism and canonization of tournaments and hypertournaments ⋮ On the isomorphism problem for decision trees and decision lists

This page was built for publication: Hypergraph isomorphism and structural equivalence of Boolean functions