Isomorphism testing of Boolean functions computable by constant-depth circuits
From MaRDI portal
Recommendations
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
- Efficient computation of approximate isomorphisms between Boolean functions
- Testing Boolean function isomorphism
- Hypergraph isomorphism and structural equivalence of Boolean functions
- Nearly tight bounds for testing function isomorphism
Cites work
- Constant depth circuits, Fourier transform, and learnability
- Hypergraph isomorphism and structural equivalence of Boolean functions
- Isomorphism testing of read-once functions and polynomials
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Nearly tight bounds for testing function isomorphism
- Parity, circuits, and the polynomial-time hierarchy
- Testing Boolean function isomorphism
- The Formula Isomorphism Problem
Cited in
(6)- Hypergraph isomorphism and structural equivalence of Boolean functions
- Efficient computation of approximate isomorphisms between Boolean functions
- On the isomorphism problem for decision trees and decision lists
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
- On the isomorphism problem for decision trees and decision lists
- Testing Boolean function isomorphism
This page was built for publication: Isomorphism testing of Boolean functions computable by constant-depth circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476155)