On coherence, random-self-reducibility, and self-correction

DOI10.1007/S000370050009zbMath0917.68074OpenAlexW3101695904MaRDI QIDQ1272663

Ashish V. Naik, Sophie Laplante, Joan Feigenbaum, Lance J. Fortnow

Publication date: 3 January 1999

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050009

zbMATH Keywords

self-reducibilityadaptive coherence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Collapsing and separating completeness notions under average-case and worst-case hypotheses ⋮ Self-correctors for Cryptographic Modules

This page was built for publication: On coherence, random-self-reducibility, and self-correction