NP versus coNP
Whenever yes answers have short efficiently checkable certificates, must no answers have them too?
Within Proof complexity · Search all subjects
Whenever yes answers have short efficiently checkable certificates, must no answers have them too?
Can one efficiently checkable proof system match every other system’s proof lengths within a polynomial factor?