Skip to main content

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits

  • Conference paper
  • 820 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7183)

Abstract

Given two n-variable Boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. I.e. a permutation π of the n variables such that f(x 1,x 2,…,x n ) and g(x π(1),x π(2),…,x π(n)) differ on at most an ε fraction of all Boolean inputs {0,1}n. We give a randomized \(2^{O(\sqrt{n}polylog(n))}\) algorithm that computes a \(\frac{1}{2^{polylog(n)}}\)-approximate isomorphism between two isomorphic Boolean functions f and g that are given by depth d circuits of poly(n) size, where d is a constant independent of n. In contrast, the best known algorithm for computing an exact isomorphism between n-ary Boolean functions has running time 2O(n) [9] even for functions computed by poly(n) size DNF formulas. Our algorithm is based on a result for hypergraph isomorphism with bounded edge size [3] and the classical Linial-Mansour-Nisan result on approximating small depth and size Boolean circuits by small degree polynomials using Fourier analysis.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM Journal on Computing 30(3), 990–1009 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Alon, N., Blais, E.: Testing Boolean Function Isomorphism. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol. 6302, pp. 394–405. Springer, Heidelberg (2010)

    Google Scholar 

  3. Babai, L., Codenotti, P.: Isomorphism of hypergraphs of low rank in moderately exponential time. In: 49th FOCS, pp. 667–676. IEEE (2008)

    Google Scholar 

  4. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: 15th STOC, pp. 171–183. ACM (1983)

    Google Scholar 

  5. Blais, E., O’Donnell, R.: Lower bounds for testing function isomorphism. In: 25th CCC, pp. 235–246. IEEE Computer Society (2010)

    Google Scholar 

  6. Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. In: Proceedings of Vision Interface, Montreal, Canada, pp. 82–88 (2000)

    Google Scholar 

  7. Chakraborty, S., García-Soriano, D., Matsliah, A.: Nearly tight bounds for testing function isomorphism. In: 22nd SODA, pp. 1683–1702. SIAM (2011)

    Google Scholar 

  8. Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM 40(3), 607–620 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: 31st STOC, pp. 652–658. ACM (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, V., Vasudev, Y. (2012). Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28332-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28331-4

  • Online ISBN: 978-3-642-28332-1

  • eBook Packages: Computer ScienceComputer Science (R0)