Polymorphisms and Circuit Complexity
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 f is characterized by the partial polymorphisms of f's truth table. Moreover, the non-deterministic circuit complexity of f is characterized by the polymorphisms of f's truth table.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.