scientific article; zbMATH DE number 2080255
From MaRDI portal
Publication:4472503
zbMATH Open1044.68060MaRDI QIDQ4472503FDOQ4472503
Authors: Chi-Jen Lu 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690302.htm
Title of this publication is not available (Why is that?)
Recommendations
- Derandomizing Arthur-Merlin games under uniform assumptions
- Derandomizing Arthur-Merlin games using hitting sets
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES
- Derandomization in game-theoretic probability
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
- New Computational Paradigms
- Arthur-Merlin games in Boolean decision trees
Cited In (11)
- Randomization, derandomization and antirandomization: Three games
- Derandomizing Arthur-Merlin games under uniform assumptions
- Derandomizing Arthur-Merlin games using hitting sets
- Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games
- Holographic Proofs and Derandomization
- Easiness assumptions and hardness tests: Trading time for zero error
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
- New Computational Paradigms
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472503)
