Polymorphisms and Circuit Complexity
Computational Complexity
2017-05-10 v2
Abstract
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function is characterized by the partial polymorphisms of 's truth table. Moreover, the non-deterministic circuit complexity of is characterized by the polymorphisms of 's truth table.
Cite
@article{arxiv.1609.04274,
title = {Polymorphisms and Circuit Complexity},
author = {Gustav Nordh},
journal= {arXiv preprint arXiv:1609.04274},
year = {2017}
}
Comments
Updated notation and fixed some typos