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.

Paper

Mapping behavioral specifications to model parameters in synthetic biology

Heinz Koeppl, Marc Hafner, et al.

BMC Bioinformatics

Conference paper

Channel coding considerations for wireless LANs

Daniel J. Costello Jr., Pierre R. Chevillat, et al.

ISIT 1997

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Trang H. Tran, Lam Nguyen, et al.

INFORMS 2022

Conference paper

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ

A. Gupta, R. Gross, et al.

SPIE Advances in Semiconductors and Superconductors 1990

View all publications

Abstract

Related

Mapping behavioral specifications to model parameters in synthetic biology

Channel coding considerations for wireless LANs

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Growth and transport properties of multilayer superconducting films of Nd1.83Ce0.17CuOx / YBa2Cu3O7-δ

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ