Pages that link to "Item:Q2819594"
From MaRDI portal
The following pages link to Hypergraph isomorphism and structural equivalence of Boolean functions (Q2819594):
Displaying 18 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- Efficient computation of approximate isomorphisms between Boolean functions (Q903194) (← links)
- Isomorphism and canonization of tournaments and hypertournaments (Q988566) (← links)
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions (Q1333159) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Cooperation through social influence (Q2630248) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism1 (Q5015600) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- Foundations of Software Science and Computation Structures (Q5308442) (← links)
- Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube (Q5854887) (← links)
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice (Q5874494) (← links)
