The complexity of short two-person games

Ashok K. Chandra; Martin Tompa

doi:10.1016/0166-218X(90)90080-V

Discrete Applied Mathematics

Paper

01 Jan 1990

The complexity of short two-person games

View publication

Abstract

Cook posed the question of finding a natural problem that is complete for AC1. It is shown here that a certain two-person game of perfect information is such a problem. Variants of this game are shown to be complete for P and for LOGCFL. © 1990.

Conference paper

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Juliann Opitz, Robert D. Allen, et al.

Microlithography 1998

Paper

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Charles A Micchelli

Journal of Approximation Theory

Conference paper

Strategies for registering range images from unknown camera positions

Fausto Bernardini, Holly Rushmeier

Proceedings of SPIE - The International Society for Optical Engineering

Conference paper

Single and dual wavelength exposure of photoresist

J. LaRue, C. Ting

Proceedings of SPIE 1989

View all publications

Abstract

Related

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Best L1 approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Strategies for registering range images from unknown camera positions

Single and dual wavelength exposure of photoresist

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines