Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR12-186 | 27th December 2012 05:39

DLOGTIME-Proof Systems

RSS-Feed




TR12-186
Authors: Andreas Krebs, Nutan Limaye
Publication: 30th December 2012 14:14
Downloads: 1994
Keywords: 


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 k-Clique. 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.



ISSN 1433-8092 | Imprint