Investigating the Power of Circuits with $MOD_6$ Gates
Computational Complexity
2018-10-15 v1
Abstract
We consider the power of Boolean circuits with MOD 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.
Cite
@article{arxiv.1810.05603,
title = {Investigating the Power of Circuits with $MOD_6$ Gates},
author = {Daniel J. Saunders},
journal= {arXiv preprint arXiv:1810.05603},
year = {2018}
}
Comments
23 pages, 1 figure, unpublished undergraduate independent study work