N. Young. Greedy algorithms by derandomizing unknown distributions. Technical Report 1087, Department of Operations Research and Industrial Engineering, Cornell University, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Simple Strategies for Large Zero-Sum Games with Applications.. - Lipton, Young (1994) (7 citations) Self-citation (Young) (Correct)
....of L, where L is any NP complete language. 2 Other Related Work Theorem 2, our first variant of von Neumann s MinMax Theorem, was obtained independently by Althofer [3] He considers applications to other linear programs, large game trees, and uniform sampling spaces. A subsequent work [20] gives simple greedy algorithms that (given the payoff matrix) find the k uniform strategies shown to exist in Theorems 2 and 3. Uniform complexity. As mentioned previously, the complexity class PSPACE has a natural characterization via games. More recently, the complexity classes NEXP and coNEXP ....
Neal E. Young. Greedy algorithms by derandomizing unknown distributions. Technical Report T.R. 1087, Cornell University Department of Operations Research and Industrial Engineering, Ithaca, NY 14853, 1994.
Lagrangian Relaxation Based Algorithms for Convex Programming.. - Khandekar (2004) (Correct)
No context found.
N. Young. Greedy algorithms by derandomizing unknown distributions. Technical Report 1087, Department of Operations Research and Industrial Engineering, Cornell University, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC