On being incoherent without being very hard
type: Item
instance of: scholarly article
title: On being incoherent without being very hard
zbMATH Open document ID: 0752.68038
DOI: 10.1007/BF01276436
author: Richard Beigel
author: Joan Feigenbaum
published in: Computational Complexity
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 93304
zbMATH Keywords: autoreducibility
zbMATH Keywords: incoherence
zbMATH Keywords: program checkability
zbMATH Keywords: random-self- reducibility
MaRDI profile type: Publication
cites work: On hiding information from an oracle
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Q3212297
cites work: Tally languages and complexity classes
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME
cites work: On helping by robust oracle machines
cites work: Relativization of the Theory of Computational Complexity
cites work: Robust algorithms: a different approach to oracles
description: scientific article; zbMATH DE number 93304