Isomorphism testing of Boolean functions computable by constant-depth circuits

DOI10.1016/j.ic.2014.08.003zbMath1310.94239OpenAlexW2064329818MaRDI QIDQ476155

Yadu Vasudev, V. Arvind

Publication date: 28 November 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.08.003

zbMATH Keywords

Boolean functionsisomorphismconstant-depth circuits

Mathematics Subject Classification ID

Related Items (1)

Efficient computation of approximate isomorphisms between Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Hypergraph isomorphism and structural equivalence of Boolean functions
• Constant depth circuits, Fourier transform, and learnability
• Parity, circuits, and the polynomial-time hierarchy
• Testing Boolean Function Isomorphism
• The Formula Isomorphism Problem

This page was built for publication: Isomorphism testing of Boolean functions computable by constant-depth circuits