2015
DOI: 10.1145/2799645
|View full text |Cite
|
Sign up to set email alerts
|

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly

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 N P and MA were introduced in passing by Fortnow, Santhanam, and Williams (CCC 2009), who also showed that those classes are related to questions on circuit complexity.In this note 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 the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 24 publications
(32 reference statements)
0
1
0
Order By: Relevance
“…The problems of proving that classes such as P, NP, and P NP have fixed polynomial-size circuits are discussed in [Lip94,FSW09,GM15,Din15], and many absurd-looking consequences have been derived from propositions such as NP ⊂ SIZE(n k ) (of course, none of these have been proved to be actually contradictory).…”
Section: Np Does Not Have Fixed Polynomial-size Circuitsmentioning
confidence: 99%
“…The problems of proving that classes such as P, NP, and P NP have fixed polynomial-size circuits are discussed in [Lip94,FSW09,GM15,Din15], and many absurd-looking consequences have been derived from propositions such as NP ⊂ SIZE(n k ) (of course, none of these have been proved to be actually contradictory).…”
Section: Np Does Not Have Fixed Polynomial-size Circuitsmentioning
confidence: 99%