Skip to main navigation Skip to search Skip to main content

Decomposability of partially defined Boolean functions

Research output: Contribution to journalArticlepeer-review

Abstract

The problem of recognizing decomposability of partially defined Boolean functions is considered. The results include polynomial time algorithms for certain important types of decomposition, as well as NP-completeness proofs for more complex structures.

Original languageEnglish (US)
Pages (from-to)51-75
Number of pages25
JournalDiscrete Applied Mathematics
Volume62
Issue number1-3
DOIs
StatePublished - Sep 8 1995

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Decomposability of partially defined Boolean functions'. Together they form a unique fingerprint.

Cite this