Helping by unambiguous computation and probabilistic computation
type: Item
instance of: scholarly article
title: Helping by unambiguous computation and probabilistic computation
zbMATH Open document ID: 0876.68065
DOI: 10.1007/BF02679447
published in: Theory of Computing Systems
publication date: 1997-11-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 989813
zbMATH Keywords: probabilistic computation
zbMATH Keywords: oracles
author: Patrizio Cintioli
author: Riccardo Silvestri
MaRDI profile type: Publication
cites work: Self-reducibility
cites work: Q4293543
cites work: Complexity classes and sparse oracles
cites work: A uniform approach to define complexity classes
cites work: Q4039803
cites work: Q3996675
cites work: Q4942624
cites work: On the power of parity polynomial time
cites work: Q4942644
cites work: Robust machines accept easy sets
cites work: ON THE LIMITATIONS OF LOCALLY ROBUST POSITIVE REDUCTIONS
cites work: On helping by robust oracle machines
cites work: CREW PRAM<scp>s</scp> and Decision Trees
cites work: Relativized Questions Involving Probabilistic Algorithms
cites work: Robust algorithms: a different approach to oracles
cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
cites work: RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
cites work: Structural properties for feasibly computable classes of type two
description: scientific article; zbMATH DE number 989813