Work

Sublogarithmic uniform Boolean proof nets

Year: 2012

Type: article

Abstract: 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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.75.2

Author: Clément Aubert

Institutions: Centre National de la Recherche Scientifique, Université Sorbonne Paris Nord, Laboratoire d'Informatique de Paris-Nord

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Agence Nationale de la Recherche

Awards: G1853753986, Complexité Implicite, Concurrence et Extraction