Deterministic Graphical Games Revisited (Q5900106)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 5291015

Language	Label	Description	Also known as
English	Deterministic Graphical Games Revisited	scientific article; zbMATH DE number 5291015

Statements

scholarly article

0 references

Deterministic Graphical Games Revisited (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-540-69407-6_1

0 references

Daniel Andersson

0 references

Kristoffer Arnsfelt Hansen

0 references

Peter Bro Miltersen

0 references

Troels Bjerre Sørensen

0 references

Logic and Theory of Algorithms

0 references

publication date

19 June 2008

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-69407-6_1

0 references

0 references

Sorting in \(c \log n\) parallel steps

0 references

0 references

The complexity of stochastic games

0 references

On model checking for the \(\mu\)-calculus and its fragments

0 references

Contributions to the Theory of Games (AM-39), Volume III

0 references

Algorithms for two bottleneck optimization problems

0 references

0 references

A fast algorithm for a class of bottleneck problems

0 references

Two-player stochastic games. I: A reduction

0 references

Two-player stochastic games. II: The case of recursive games

0 references

Deterministic graphical games

0 references

The complexity of mean payoff games on graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5900106

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5900106&oldid=35061515"