Sublogarithmic uniform Boolean proof nets

@inproceedings{Aubert2011SublogarithmicUB,
  title={Sublogarithmic uniform Boolean proof nets},
  author={Cl{\'e}ment Aubert},
  booktitle={DICE},
  year={2011}
}
Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC 0 and focuses on a simpler restricted notion of uniform Boolean proof nets. We can then encode constant-depth circuits and compare complexity classes below… CONTINUE READING