Derandomizing Arthur-Merlin games under uniform assumptions
type: Item
instance of: scholarly article
title: Derandomizing Arthur-Merlin games under uniform assumptions
zbMATH Open document ID: 0993.68038
author: Cgi-Jen Lu
published in: Computational Complexity
publication date: 2002-06-17T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1756794
zbMATH Keywords: derandomization
MaRDI profile type: Publication
full work available at URL: s00037-001-8196-9
OpenAlex ID: W2082571280
DOI: 10.1007/S00037-001-8196-9
Recommended article: Q4472503
Recommended article: Derandomizing Arthur-Merlin games using hitting sets
Recommended article: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Recommended article: Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
Recommended article: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Recommended article: NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES
Recommended article: Derandomization in game-theoretic probability
Recommended article: Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
Recommended article: New Computational Paradigms
Recommended article: Arthur-Merlin games in Boolean decision trees
description: scientific article; zbMATH DE number 1756794