Matches in SemOpenAlex for { <https://semopenalex.org/work/W1963571124> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W1963571124 endingPage "250" @default.
- W1963571124 startingPage "235" @default.
- W1963571124 abstract "The problem whether winning regions and wining strategies for parity games can be computed in polynomial time is a major open problem in the field of infinite games, which is relevant for many applications in logic and formal verification. For some time the discrete strategy improvement algorithm due to Jurdziński and Vöge had been considered to be a candidate for solving parity games in polynomial time. However, it has recently been proved by Oliver Friedmann that this algorithm requires super-polynomially many iteration steps, for all popular local improvements rules, including switch-all (also with Fearnley's snare memorisation), switch-best, random-facet, random-edge, switch-half, least-recently-considered, and Zadeh's Pivoting rule. We analyse the examples provided by Friedmann in terms of complexity measures for directed graphs such as treewidth, DAG-width, Kelly-width, entanglement, directed pathwidth, and cliquewidth. It is known that for every class of parity games on which one of these parameters is bounded, the winning regions can be efficiently computed. It turns out that with respect to almost all of these measures, the complexity of Friedmann's counterexamples is bounded, and indeed in most cases by very small numbers. This analysis strengthens in some sense Friedmann's results and shows that the discrete strategy improvement algorithm is even more limited than one might have thought. Not only does it require super-polynomial running time in the general case, where the problem of polynomial-time solvability is open, it even has super-polynomial time lower bounds on natural classes of parity games on which efficient algorithms are known." @default.
- W1963571124 created "2016-06-24" @default.
- W1963571124 creator A5010064604 @default.
- W1963571124 creator A5012935978 @default.
- W1963571124 creator A5073512540 @default.
- W1963571124 date "2014-12-01" @default.
- W1963571124 modified "2023-09-30" @default.
- W1963571124 title "The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs" @default.
- W1963571124 cites W1431717825 @default.
- W1963571124 cites W1505081061 @default.
- W1963571124 cites W1567990440 @default.
- W1963571124 cites W1594997032 @default.
- W1963571124 cites W186942940 @default.
- W1963571124 cites W1887255787 @default.
- W1963571124 cites W1898131300 @default.
- W1963571124 cites W1976120600 @default.
- W1963571124 cites W1977644778 @default.
- W1963571124 cites W1994887153 @default.
- W1963571124 cites W2069058599 @default.
- W1963571124 cites W2071453765 @default.
- W1963571124 cites W2073264848 @default.
- W1963571124 cites W2090787331 @default.
- W1963571124 cites W2127618440 @default.
- W1963571124 cites W2133853963 @default.
- W1963571124 cites W2142133061 @default.
- W1963571124 cites W2145019049 @default.
- W1963571124 cites W2152479402 @default.
- W1963571124 cites W2412582712 @default.
- W1963571124 cites W867319508 @default.
- W1963571124 doi "https://doi.org/10.1016/j.tcs.2013.12.021" @default.
- W1963571124 hasPublicationYear "2014" @default.
- W1963571124 type Work @default.
- W1963571124 sameAs 1963571124 @default.
- W1963571124 citedByCount "3" @default.
- W1963571124 countsByYear W19635711242016 @default.
- W1963571124 countsByYear W19635711242017 @default.
- W1963571124 countsByYear W19635711242020 @default.
- W1963571124 crossrefType "journal-article" @default.
- W1963571124 hasAuthorship W1963571124A5010064604 @default.
- W1963571124 hasAuthorship W1963571124A5012935978 @default.
- W1963571124 hasAuthorship W1963571124A5073512540 @default.
- W1963571124 hasBestOaLocation W19635711241 @default.
- W1963571124 hasConcept C109214941 @default.
- W1963571124 hasConcept C11413529 @default.
- W1963571124 hasConcept C121332964 @default.
- W1963571124 hasConcept C2777151079 @default.
- W1963571124 hasConcept C33923547 @default.
- W1963571124 hasConcept C41008148 @default.
- W1963571124 hasConcept C80444323 @default.
- W1963571124 hasConceptScore W1963571124C109214941 @default.
- W1963571124 hasConceptScore W1963571124C11413529 @default.
- W1963571124 hasConceptScore W1963571124C121332964 @default.
- W1963571124 hasConceptScore W1963571124C2777151079 @default.
- W1963571124 hasConceptScore W1963571124C33923547 @default.
- W1963571124 hasConceptScore W1963571124C41008148 @default.
- W1963571124 hasConceptScore W1963571124C80444323 @default.
- W1963571124 hasLocation W19635711241 @default.
- W1963571124 hasLocation W19635711242 @default.
- W1963571124 hasOpenAccess W1963571124 @default.
- W1963571124 hasPrimaryLocation W19635711241 @default.
- W1963571124 hasRelatedWork W1958890868 @default.
- W1963571124 hasRelatedWork W2333698505 @default.
- W1963571124 hasRelatedWork W2351491280 @default.
- W1963571124 hasRelatedWork W2371447506 @default.
- W1963571124 hasRelatedWork W2386767533 @default.
- W1963571124 hasRelatedWork W2392953011 @default.
- W1963571124 hasRelatedWork W3016060852 @default.
- W1963571124 hasRelatedWork W303980170 @default.
- W1963571124 hasRelatedWork W3123479446 @default.
- W1963571124 hasRelatedWork W4287816611 @default.
- W1963571124 hasVolume "560" @default.
- W1963571124 isParatext "false" @default.
- W1963571124 isRetracted "false" @default.
- W1963571124 magId "1963571124" @default.
- W1963571124 workType "article" @default.