Pages that link to "Item:Q476155"
From MaRDI portal
The following pages link to Isomorphism testing of Boolean functions computable by constant-depth circuits (Q476155):
Displaying 4 items.
- Efficient computation of approximate isomorphisms between Boolean functions (Q903194) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Hypergraph isomorphism and structural equivalence of Boolean functions (Q2819594) (← links)
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (Q2890182) (← links)