Concepedia

Lower bounds for multiplayer noncooperative games of incomplete information

Gary L. Peterson, John H. Reif, Salman Azhar

Computers & Mathematics with Applications · 2001 · 130 citations · 24 references

DOI

Concepts

References

24

The polynomial-time hierarchy

Larry J. Stockmeyer · Theoretical Computer Science · 1976 · 1.3K citations

Alternation

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text

, , +17

On the computational complexity of algorithms

Juris Hartmanis, Richard E. Stearns · Transactions of the American Mathematical Society · 1965 · 957 citations · Full text

, , +15

Word problems requiring exponential time(Preliminary Report)

Larry J. Stockmeyer, Albert R. Meyer · 1973 · 874 citations

, , +13

On the complexity of some two-person perfect-information games

Thomas J. Schaefer · Journal of Computer and System Sciences · 1978 · 312 citations

, , +12