Name
Abstract | ||
|---|---|---|
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by Fortnow, Santhanam, and Williams, who also showed that those classes are related to questions on circuit complexity. In this article, we wish to highlight the notion of input-oblivious proof systems and initiate a more systematic study of them. We begin by describing in detail the results of Fortnow et al. and discussing their connection to circuit complexity. We then extend the study to input-oblivious versions of IP, and PCP, and ZK and present few preliminary results regarding those versions. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2799645 | ACM Transactions on Computation Theory (TOCT) |
Keywords | Field | DocType |
BPP,EXP,IP,MA,NE,NEXP,NP,PCP,P/poly,RP,E,ZK | NEXPTIME,Discrete mathematics,Circuit complexity,P/poly,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 4 | 1942-3454 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oded Goldreich | 1 | 12376 | 2035.01 |
| Or Meir | 2 | 66 | 10.47 |