Investigating the Power of Circuits with MOD₆ Gates
classification
💻 cs.CC
keywords
circuitsbooleancomplexitygatesmodelpoweralgebraalgebraic
read the original abstract
We consider the power of Boolean circuits with MOD$_{6}$ gates. First, we introduce a few basic notions of computational complexity, and describe the standard models with which we study the complexity of problems. We then define the model of Boolean circuits, equate a restricted class of circuits with an algebraic model, and present some results from working with this algebra.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.