Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
No label defined
(Q3384167)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
No label defined
scientific article
Statements
instance of
scholarly article
0 references
author
Massimo Benerecetti
0 references
Daniele Dell'Erba
0 references
Fabio Mogavero
0 references
publication date
14 December 2021
0 references
full work available at URL
https://arxiv.org/abs/1709.02099
0 references
http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2017.9
0 references
MaRDI profile type
MaRDI publication profile
0 references
cites work
Alternating-time temporal logic
0 references
Q3083813
0 references
Graph isomorphism in quasipolynomial time [extended abstract]
0 references
Solving Parity Games via Priority Promotion
0 references
Q5015267
0 references
Substructure Temporal Logic
0 references
Fixed-point logics and solitaire games
0 references
Deciding parity games in quasipolynomial time
0 references
Strategy logic
0 references
Generalized Mean-payoff and Energy Games
0 references
Positional strategies for mean payoff games
0 references
On model checking for the \(\mu\)-calculus and its fragments
0 references
Recursive algorithm for parity games requires exponential time
0 references
Solving Parity Games in Practice
0 references
Automata, logics, and infinite games. A guide to current research
0 references
Cyclic games and an algorithm to find minimax cycle means in directed graphs
0 references
Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
0 references
Q4501540
0 references
Q5144638
0 references
A deterministic subexponential algorithm for solving parity games
0 references
A Deterministic Subexponential Algorithm for Solving Parity Games
0 references
Q4542592
0 references
Borel determinacy
0 references
Q4722064
0 references
Infinite games played on finite graphs
0 references
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
0 references
Reasoning About Strategies
0 references
Q2980973
0 references
Q2908844
0 references
Q3753490
0 references
Benchmark Graphs for Practical Graph Isomorphism
0 references
Solving Parity Games in Big Steps
0 references
ATL* Satisfiability Is 2EXPTIME-Complete
0 references
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
0 references
Q2754084
0 references
Alternating tree automata, parity games, and modal \(\mu\)-calculus
0 references
Infinite games on finitely coloured graphs with applications to automata on infinite trees
0 references
The complexity of mean payoff games on graphs
0 references
Identifiers
zbMATH Open document ID
1483.91049
0 references
Mathematics Subject Classification ID
91A43
0 references
68Q25
0 references
68W05
0 references
zbMATH DE Number
7445162
0 references
arXiv ID
1709.02099
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:3384167
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
