IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/97-01-007.html
   My bibliography  Save this paper

Circuits and Expressions with Non-Associative Gates

Author

Listed:

Abstract

We consider circuits and expressions whose gates carry out multiplication in a non-associative algebra such as a quasigroup or loop. We define a class we call the polyabelian algebras, formed by iterated quasidirect products of Abelian groups. We show that a quasigroup can express arbitrary Boolean functions if and only if it is not polyabelian, in which case its EXPRESSION EVALUATION and CIRCUIT VALUE problems are NC1-complete and P-complete respectively. This is not true for algebras in general, and we give a counter-example. We show that EXPRESSION EVALUATION is also NC1-complete if the TC0 if the algebra is both polyabelian and has a solvable multiplication semigroup, e.g., for a nilpotent loop or group. Thus, in the non-associative case, earlier results about the role of solvability in circuit complexity generalize in several different ways.

Suggested Citation

  • Joshua Berman & Arthur Drisko & Francois Lemieux & Cristopher Moore & Denis Therien, 1997. "Circuits and Expressions with Non-Associative Gates," Working Papers 97-01-007, Santa Fe Institute.
  • Handle: RePEc:wop:safiwp:97-01-007
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:97-01-007. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.