Introduces witness complexity γ(x) measuring expansion time of near-shortest descriptions, proving polynomial invariance, conditional separation from KC under P≠NP, and a biconditional characterization of P=NP via the relative variant γP.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Witness Complexity of Short Descriptions: A Cryptographic Perspective
Introduces witness complexity γ(x) measuring expansion time of near-shortest descriptions, proving polynomial invariance, conditional separation from KC under P≠NP, and a biconditional characterization of P=NP via the relative variant γP.