Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computational Complexity

arXiv:1201.1120v1 (cs)
[Submitted on 5 Jan 2012]

Title:Sublogarithmic uniform Boolean proof nets

Authors:Clément Aubert (LIPN - UMR7030 CNRS - Université Paris 13)
View PDF
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.
Comments: In Proceedings DICE 2011, arXiv:1201.0345
Subjects: Computational Complexity (cs.CC); Logic in Computer Science (cs.LO)
Cite as: arXiv:1201.1120 [cs.CC]
  (or arXiv:1201.1120v1 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.1201.1120
Journal reference: EPTCS 75, 2012, pp. 15-27
Related DOI: https://doi.org/10.4204/EPTCS.75.2

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Thu, 5 Jan 2012 11:06:50 UTC (20 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.CC
< prev   |   next >
new | recent | 2012-01
Change to browse by:
cs
cs.LO

References & Citations

DBLP - CS Bibliography

listing | bibtex
Clément Aubert
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)