Skip to main content
SpringerLink
Log in
SpringerLink
Log in

AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2016)

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

Included in the following conference series:

Abstract

In this article, we present an algorithm for conjunctive bi–decomposition of boolean polynomials where decomposition components share only prescribed variables. It is based on the polynomial–time algorithm of disjoint decomposition developed before. Some examples and evaluation of the algorithm are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Notes

  1. 1.

    \(\mathcal{U}_F\) is also called the support of function supp(F). Its cardinality is also called the weight of function wt(F).

  2. 2.

    To exclude polynomials with trivial divisors they have to be relative prime.

References

  1. Perkowski, M.A., Grygiel, S.: A survey of literature on function decomposition, Version IV. PSU Electrical Engineering Department Report, Portland State University, Portland, Oregon, USA, November 1995

    Google Scholar 

  2. Khatri, S.P., Gulati, K. (eds.): Advanced Techniques in Logic Synthesis, Optimizations and Applications. Springer, New York (2011)

    Google Scholar 

  3. Mishchenko, A., Sasao, T.: Large-scale SOP minimization using decomposition and functional properties. In: Proceedings of the 40th ACM/IEEE Design Automation Conference (DAC ’03), pp. 149–154. ACM, New York (2003)

    Google Scholar 

  4. Steinbach, B., Lang, C.: Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition. Artif. Intell. Rev. 20(3–4), 319–360 (2003)

    Article  MATH  Google Scholar 

  5. Bioch, J.C.: The complexity of modular decomposition of Boolean functions. Discrete Appl. Math. 149(1–3), 1–13 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bioch, J.C.: Decomposition of Boolean functions. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of Mathematics and its Applications, vol. 134, pp. 39–78. Cambridge University Press, New York (2010)

    Chapter  Google Scholar 

  7. Choudhury, M., Mohanram, K.: Bi-decomposition of large Boolean functions using Blocking Edge Graphs. In: Proceedings of the 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD ’10), pp. 586–591. IEEE Press, Piscataway (2010)

    Google Scholar 

  8. Mishchenko, A., Steinbach, B., Perkowski, M.A.: An algorithm for bi-decomposition of logic functions. In: Proceedings of the 38th ACM/IEEE Design Automation Conference (DAC ’01), pp. 103–108. ACM, New York (2001)

    Google Scholar 

  9. Emelyanov, P., Ponomaryov, D.: On tractability of disjoint AND-decomposition of Boolean formulas. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 92–101. Springer, Heidelberg (2015)

    Google Scholar 

  10. Emelyanov, P., Ponomaryov, D.: Algorithmic issues of conjunctive decomposition of boolean formulas. Programming and Computer Software 41(3) (2015) 162–169 Translated: Programmirovanie, vol. 41, No. 3, pp. 62–72 (2015)

    Google Scholar 

  11. Shpilka, A., Volkovich, I.: On the relation between polynomial identity testing and finding variable disjoint factors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 408–419. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Zhegalkin, I.: Arithmetization of symbolic logics. Sb. Math. 35(1), 311–377 (1928). In Russian

    Google Scholar 

  13. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013)

    Book  MATH  Google Scholar 

  14. Ponomaryov, D.: On decomposability in logical calculi. Bull. Novosibirsk Comput. Cent. 28, 111–120 (2008)

    MATH  Google Scholar 

  15. Kuon, I., Tessier, R., Rose, J.: FPGA Architecture: Survey and Challenges. Now Publishers Inc., Boston - Delft (2008)

    Google Scholar 

  16. Kopparty, S., Saraf, S., Shpilka, A.: Equivalence of polynomial identity testing and polynomial factorization. Comput. Complex. 24(2), 295–331 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics Systems, Lavrentiev Ave. 6, Novosibirsk, Russia

    Pavel Emelyanov

  2. Novosibirsk State University, Pirogova St. 2, Novosibirsk, Russia

    Pavel Emelyanov

Authors
  1. Pavel Emelyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Emelyanov .

Editor information

Editors and Affiliations

  1. Indian Institute of Science, Bangalore, India

    Sathish Govindarajan

  2. Carleton University, Ottawa, ON, Canada

    Anil Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Emelyanov, P. (2016). AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29221-2_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29220-5

  • Online ISBN: 978-3-319-29221-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation