Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.070 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133559308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Under-Approximation of Winning Regions in Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless Determinacy of Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local model checking in the modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:48, 9 July 2024

scientific article; zbMATH DE number 6418430
Language Label Description Also known as
English
Polynomial-Time Under-Approximation of Winning Regions in Parity Games
scientific article; zbMATH DE number 6418430

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references