Skip to main content
SpringerLink
Log in

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

The paper analyzes in terms of polynomial time many-one reductions the computational complexity of several natural equivalence relations on Boolean functions which derive from replacing variables by expressions, one of them is the Boolean isomorphism relation. Most of these computational problems turn out to be between co-NP and \(\Sigma\) p 2 .

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

Author information

Authors and Affiliations

  1. Mathematisches Institut, INF 294, Universität Heidelberg, 69120 Heidelberg, Germany bb@math.uni-heidelberg.de, fstephan@math.uni-heidelberg.de, , , , , , DE

    B. Borchert & F. Stephan

  2. Department of Computer Science, Science Hall 159, New Mexico State University, Las Cruces, NM 88011, USA dranjan@cs.nmsu.edu, , , , , , MX

    D. Ranjan

Authors
  1. B. Borchert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Ranjan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Stephan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 1996, and in final form March 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borchert, B., Ranjan, D. & Stephan, F. On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions . Theory Comput. Systems 31, 679–693 (1998). https://doi.org/10.1007/s002240000109

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000109

Keywords

Search

Navigation