Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
type: Item
instance of: scholarly article
title: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
zbMATH Open document ID: 1085.68055
author: Dan Gutfreund
author: Ronen Shaltiel
author: Amnon Ta-Shma
published in: Computational Complexity
publication date: 2005-02-11T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 2133454
zbMATH Keywords: Derandomization
zbMATH Keywords: Arthur-Merlin games
MaRDI profile type: Publication
full work available at URL: s00037-003-0178-7
OpenAlex ID: W3165549676
Wikidata QID: Q62398486
DBLP publication ID: journals/cc/GutfreundST03
DOI: 10.1007/S00037-003-0178-7
Recommended article: Q4472503
Recommended article: Derandomizing Arthur-Merlin games under uniform assumptions
Recommended article: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Recommended article: Derandomizing Arthur-Merlin games using hitting sets
Recommended article: Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
Recommended article: NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES
Recommended article: Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
Recommended article: On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
Recommended article: Limitations of Hardness vs. Randomness under Uniform Reductions
Recommended article: Q4699288
description: scientific article; zbMATH DE number 2133454