DLOGTIME Proof Systems

Abstract

We define DLOGTIME proof systems, DLTPS, which generalize NC0 proof systems. It is known that functions such as Exactk and Majority do not have NC0 proof systems. Here, we give a DLTPS for Exactk (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… (More)
DOI: 10.4230/LIPIcs.FSTTCS.2013.189

Topics

  • Presentations referencing similar topics