Games, complexity classes, and approximation algorithms.

zbMATH Open1034.68521MaRDI QIDQ1126837

Joan Feigenbaum

Publication date: 5 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222677

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

perfect informationperfect recall

Mathematics Subject Classification ID

Game theory (91A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Playing Games with Approximation Algorithms

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Recent results and questions in combinatorial game complexities 👍 👎
• Playing Games with Approximation Algorithms 👍 👎
• The Complexity of Solving Stochastic Games on Graphs 👍 👎
• Algorithmic Aspects of the Core of Combinatorial Optimization Games 👍 👎
• Mathematical Foundations of Computer Science 2005 👍 👎

This page was built for publication: Games, complexity classes, and approximation algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126837)