skip to main content
research-article

Characterizing Arithmetic Read-Once Formulae

Published:03 February 2016Publication History
Skip Abstract Section

Abstract

An arithmetic Read-Once Formula (ROF for short) is a formula (i.e., a tree of computation) in which the operations are { +, ×} and such that every input variable labels at most one leaf. We give a simple characterization of such formulae. Other than being interesting in its own right, our characterization gives rise to a property-testing algorithm for functions computable by such formulae. To the best of our knowledge, prior to our work, no characterization and/or property-testing algorithm was known for this kind of formulae.

References

  1. N. Alon. 1999. Combinatorial nullstellensatz. Combinatorics, Probability and Computing 8 (1999), 7--29. Google ScholarGoogle ScholarCross RefCross Ref
  2. M. Anderson, D. van Melkebeek, and I. Volkovich. 2015. Derandomizing polynomial identity testing for multilinear constant-read formulae. Computational Complexity (2015). published Online First, 82 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Angluin, L. Hellerstein, and M. Karpinski. 1993. Learning read-once formulas with queries. Journal of the ACM 40, 1 (1993), 185--210. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Arora and M. Sudan. 2003. Improved low-degree testing and its applications. Combinatorica 23, 3 (2003), 365--426. DOI:http://dx.doi.org/10.1007/s00493-003-0025-0Google ScholarGoogle ScholarCross RefCross Ref
  5. D. Bshouty and N. H. Bshouty. 1998. On interpolating arithmetic read-once formulas with exponentiation. JCSS 56, 1 (1998), 112--124. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. H. Bshouty and R. Cleve. 1998. Interpolating arithmetic read-once formulas in parallel. SIAM Journal on Computing 27, 2 (1998), 401--413. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. H. Bshouty, T. R. Hancock, and L. Hellerstein. 1995a. Learning arithmetic read-once formulas. SIAM Journal on Computing 24, 4 (1995), 706--735. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. H. Bshouty, T. R. Hancock, and L. Hellerstein. 1995b. Learning boolean read-once formulas with arbitrary symmetric and constant fan-in gates. JCSS 50 (1995), 521--542. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. 1991. Approximating clique is almost NP-complete. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS). 2--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. V. A. Gurvich. 1977. On repetition-free boolean functions. Uspekhi Matematicheskikh Nauk 32, 1 (1977), 183--184. (in Russian).Google ScholarGoogle Scholar
  11. T. R. Hancock and L. Hellerstein. 1991. Learning read-once formulas over fields and extended bases. In Proceedings of the 4th Annual Workshop on Computational Learning Theory (COLT). 326--336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Karchmer, N. Linial, I. Newman, M. E. Saks, and A. Wigderson. 1993. Combinatorial characterization of read-once formulae. Discrete Mathematics 114, 1--3 (1993), 275--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Klivans and D. Spielman. 2001. Randomness efficient identity testing of multivariate polynomials. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC). 216--223. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. T. Schwartz. 1980. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 4 (1980), 701--717. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Shpilka and I. Volkovich. 2010. On the relation between polynomial identity testing and finding variable disjoint factors. In Automata, Languages and Programming, 37th International Colloquium (ICALP). 408--419. Full version at http://eccc.hpi-web.de/report/2010/036. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. Shpilka and I. Volkovich. 2014. On reconstruction and testing of read-once formulas. Theory of Computing 10 (2014), 465--514.Google ScholarGoogle ScholarCross RefCross Ref
  17. A. Shpilka and I. Volkovich. 2015. Read-once polynomial identity testing. Computational Complexity 24, 3 (2015), 477--532. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Shpilka and A. Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5, 3--4 (2010), 207--388. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Computation. 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Characterizing Arithmetic Read-Once Formulae

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Computation Theory
        ACM Transactions on Computation Theory  Volume 8, Issue 1
        February 2016
        97 pages
        ISSN:1942-3454
        EISSN:1942-3462
        DOI:10.1145/2889309
        Issue’s Table of Contents

        Copyright © 2016 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 February 2016
        • Revised: 1 July 2015
        • Accepted: 1 July 2015
        • Received: 1 August 2014
        Published in toct Volume 8, Issue 1

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!