Skip to main content
SpringerLink
Log in

Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider the problem of dualizing a Boolean function f represented by a DNF. In its most general form, this problem is commonly believed not to be solvable by a quasi-polynomial total time algorithm. We show that if the input DNF is quadratic or is a special degree-k DNF, then dualization turns out to be equivalent to hypergraph dualization in hypergraphs of bounded degree and hence it can be achieved in incremental polynomial time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Blake, A. (1937). Canonical expressions in Boolean algebras. Dissertation, Department of Mathematics, University of Chicago. Published by University of Chicago Libraries, 1938.

  • Bioch, J. C., & Ibaraki, T. (1995). Complexity of identification and dualization of positive Boolean functions. Information and Computation, 123, 50–63.

    Article  Google Scholar 

  • Boros, E., Crama, Y., & Hammer, P. L. (1990). Polynomial-time inference of all valid implications for Horn and related formulae. Annals of Mathematics and Artificial Intelligence, 1, 21–31.

    Article  Google Scholar 

  • Boros, E., Hammer, P. L., Ibaraki, T., & Kawakami, K. (1997). Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM Journal on Computing, 26, 93–109.

    Article  Google Scholar 

  • Boros, E., Gurvich, V., & Hammer, P. L. (1998). Dual subimplicants of positive Boolean functions. Optimization Methods and Software, 10, 147–156.

    Article  Google Scholar 

  • Crama, Y. (1987). Dualization of regular Boolean functions. Discrete Applied Mathematics, 16, 79–85.

    Article  Google Scholar 

  • Crama, Y., & Hammer, P. L. et al. (2009, in press). Boolean functions theory algorithms and applications.

  • Eiter, T., & Gottlob, G. (1995). Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24, 1278–1304.

    Article  Google Scholar 

  • Eiter, T., Ibaraki, T., & Makino, K. (1998). Double Horn functions. Information and Computation, 144, 155–190.

    Article  Google Scholar 

  • Eiter, T., Ibaraki, T., & Makino, K. (2002). Recognition and dualization of disguised bidual Horn functions. Information Processing Letters, 82, 283–291.

    Article  Google Scholar 

  • Eiter, T., Gottlob, G., & Makino, K. (2003). New results on monotone dualization and generating hypergraph transversals. SIAM Journal on Computing, 32(2), 514–537.

    Article  Google Scholar 

  • Eiter, T., Makino, K., & Gottlob, G. (2008). Computational aspects of monotone dualization: A brief survey. Discrete Applied Mathematics, 156, 2035–2049.

    Article  Google Scholar 

  • Ekin, O. (1997). Special classes of Boolean functions. Ph.D. Thesis, Rutgers University, Piscataway, USA.

  • Ekin, O., Hammer, P. L., & Peled, U. N. (1997). Horn functions and submodular Boolean functions. Discrete Applied Mathematics, 175, 257–270.

    Google Scholar 

  • Ekin, O., Foldes, S., Hammer, P. L., & Hellerstein, L. (2000). Equational characterizations of Boolean function classes. Discrete Mathematics, 211, 27–51.

    Article  Google Scholar 

  • Fredman, M., & Khachiyan, L. (1996). On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21, 618–628.

    Article  Google Scholar 

  • Hammer, P. L., & Kogan, A. (1995). Quasi-acyclic propositional Horn knowledge bases. IEEE Transaction on Knowledge and Data Engineering, 7(5), 751–762.

    Article  Google Scholar 

  • Johnson, D. S., Yannakakis, M., & Papadimitriou, C. (1988). On generating all maximal independent sets. Information Processing Letters, 27, 119–123.

    Article  Google Scholar 

  • Khardon, R. (1995). Translating between Horn representations and their characteristic nodels. Journal of Artificial Intelligence Research, 3, 349–372.

    Google Scholar 

  • Lawler, E. L., Lenstra, J. K., & Rinooy Kan, H. G. (1980). Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM Journal on Computing, 9, 558–565.

    Article  Google Scholar 

  • Makino, K. (2003). Efficient dualization of O(log n)-term monotone disjunctive normal forms. Discrete Applied Mathematics, 126, 305–312.

    Article  Google Scholar 

  • Makino, K., & Ibaraki, T. (1998). A fast and simple algorithm for identifying 2-monotonic positive Boolean functions. Journal of Algorithms, 26, 291–305.

    Article  Google Scholar 

  • Makino, K., & Uno, T. (2004). New algorithms for enumerating all maximal cliques. In Lecture notes in computer science (Vol. 3111, pp. 260–272). Berlin: Springer.

    Google Scholar 

  • Peled, U. N., & Simeone, B. (1985). Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Applied Mathematics, 12, 57–69.

    Article  Google Scholar 

  • Peled, U. N., & Simeone, B. (1994). An O(nm)-time algorithm for computing the dual of a regular Boolean function. Discrete Applied Mathematics, 49, 309–323.

    Article  Google Scholar 

  • Quine, W. V. (1952). The problem of simplifying truth functions. American Mathematical Monthly, 59, 521–531.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Bilkent University, Ankara, Turkey

    O. Ekin Karaşan

Authors
  1. O. Ekin Karaşan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to O. Ekin Karaşan.

Additional information

In memory of Peter L. Hammer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karaşan, O.E. Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions. Ann Oper Res 188, 251–261 (2011). https://doi.org/10.1007/s10479-009-0637-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-009-0637-x

Keywords

Search

Navigation