AND–decomposition of boolean polynomials with prescribed shared variables

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAlgorithms and Discrete Applied Mathematics - 2nd International Conference, CALDAM 2016, Proceedings
PublisherSpringer-Verlag GmbH and Co. KG
Pages164-175
Number of pages12
Volume9602
ISBN (Print)9783319292205
DOIs
Publication statusPublished - 1 Jan 2016
Event2nd International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016 - Thiruvananthapuram, India
Duration: 17 Feb 201619 Feb 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9602
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2016
Country/TerritoryIndia
CityThiruvananthapuram
Period17.02.201619.02.2016

Keywords

  • AND–decomposition of boolean functions
  • Combinatorial optimization
  • Disjoint decomposition
  • Factoring polynomials over finite fields
  • Sharing prescribed variables between decomposition components

Fingerprint

Dive into the research topics of 'AND–decomposition of boolean polynomials with prescribed shared variables'. Together they form a unique fingerprint.

Cite this