Approximating linear programming is log-space complete for P

Making games short (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Approximating Scheduling Unrelated Parallel Machines in Parallel

Computational Optimization and Applications

The complexity of approximating pspace-complete problems for hierarchical specifications

Nordic Journal of Computing

Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing

QIP = PSPACE

Proceedings of the forty-second ACM symposium on Theory of computing

QIP = PSPACE

Journal of the ACM (JACM)