Sublogarithmic uniform Boolean proof nets

Details Sublogarithmic uniform Boolean proof nets Sublogarithmic uniform Boolean proof nets

2012-01-05

arxiv.org/abs/1201.1120v1

EPTCS 75, 2012, pp. 15-27

Computer Science

Computational Complexity

In Proceedings DICE 2011, arXiv:1201.0345

Scientific paper

10.4204/EPTCS.75.2

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 AC0 and focuses on a simpler restricted notion of uniform Boolean proof nets. We can then encode constant-depth circuits and compare complexity classes below logspace, which were out of reach with the previous translations.

Affiliated with

Also associated with

No associations

Rating

Sublogarithmic uniform Boolean proof nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sublogarithmic uniform Boolean proof nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sublogarithmic uniform Boolean proof nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-609577