On randomized versus deterministic computation
type: Item
instance of: scholarly article
title: On randomized versus deterministic computation
zbMATH Open document ID: 0877.68053
DOI: 10.1016/0304-3975(95)00127-1
author: Marek Karpinski
author: Rutger Verbeek
published in: Theoretical Computer Science
publication date: 1997-09-09T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 1058317
zbMATH Keywords: randomized computation
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00127-1
OpenAlex ID: W1530257172
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Q4195937
cites work: Q4385525
cites work: Circuit-size lower bounds and non-reducibility to sparse sets
cites work: Q4385522
cites work: On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
cites work: Q3819053
cites work: Relativized Questions Involving Probabilistic Algorithms
cites work: On Approximation Algorithms for # P
Recommended article: On randomized versus deterministic computation
Recommended article: Randomness -- a computational complexity perspective
Recommended article: Randomness – A Computational Complexity Perspective
Recommended article: On randomness, determinism and computability
Recommended article: Q5004963
Recommended article: Randomness and Computation
Recommended article: Randomness and completeness in computational complexity
Recommended article: The Power and Weakness of Randomness in Computation
Recommended article: Q5489365
description: scientific article; zbMATH DE number 1058317