On Uniformity and Circuit Lower Bounds

@article{Santhanam2014OnUA,
  title={On Uniformity and Circuit Lower Bounds},
  author={Rahul Santhanam and Ryan Williams},
  journal={computational complexity},
  year={2014},
  volume={23},
  pages={177-205}
}
We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits. Our results can be divided into two parts: 1. Lower bounds against medium-uniform circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex (stronger than LOGTIME) but not infeasible. Using a new kind of indirect diagonalization argument, we prove several new unconditional lower bounds against… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

Similar Papers

Loading similar papers…