Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
Hitting Sets
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Unconditional derandomization of Arthur-Merlin games
★★★
Author(s):
Shaltiel
;
Umans
Problem
Prove
unconditionally
that
.
Keywords:
Arthur-Merlin
;
Hitting Sets
;
unconditional
Posted by
ormeir
updated July 16th, 2007
add new comment
Navigate
Subject
Algebra
(295)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more