Skip to main content
SpringerLink
Log in

Quadratic Sequential Computations of Boolean Mappings

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

Abstract

This paper proposes a constructive proof that any mapping on n boolean variables can be computed by a straight-line program made up of n2 assignments of the n input variables.

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. Laboratoire ERMIT, Université de la Réunion, 15 av. René Cassin, BP 7151, 97715 Saint-Denis messag. cedex 9, France

    Serge Burckel & Marianne Morillon

Authors
  1. Serge Burckel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marianne Morillon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Serge Burckel or Marianne Morillon.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burckel, S., Morillon, M. Quadratic Sequential Computations of Boolean Mappings. Theory Comput Systems 37, 519–525 (2004). https://doi.org/10.1007/s00224-003-1069-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1069-7

Keywords

Search

Navigation