License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2013.189
URN: urn:nbn:de:0030-drops-43725
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4372/
Krebs, Andreas ;
Limaye, Nutan
DLOGTIME Proof Systems
Abstract
We define DLOGTIME proof systems, DLTPS, which generalize NC0 proof systems. It is known that functions such as Exact_k and Majority do not have NC0 proof systems. Here, we give a DLTPS for Exact_k (and therefore for Majority) and also for other natural functions such as Reach and Cliquek. Though many interesting functions have DLTPS, we show that there are languages in NP which do not have DLTPS.
We consider the closure properties of DLTPS and prove that they are closed under union and concatenation but are not closed under intersection and complement. Finally, we consider a hierarchy of polylogarithmic time proof systems and show that the hierarchy is strict.
BibTeX - Entry
@InProceedings{krebs_et_al:LIPIcs:2013:4372,
author = {Andreas Krebs and Nutan Limaye},
title = {{DLOGTIME Proof Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages = {189--200},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-64-4},
ISSN = {1868-8969},
year = {2013},
volume = {24},
editor = {Anil Seth and Nisheeth K. Vishnoi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4372},
URN = {urn:nbn:de:0030-drops-43725},
doi = {10.4230/LIPIcs.FSTTCS.2013.189},
annote = {Keywords: Proof systems, DLOGTIME, NC0}
}
Keywords: |
|
Proof systems, DLOGTIME, NC0 |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) |
Issue Date: |
|
2013 |
Date of publication: |
|
10.12.2013 |