📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Partial Solvers for Parity Games: Effective Polynomial-Time Composition (2016)

First Author: Ah-Fat P

Attributed to: Complete and Efficient Checks for Branching-Time Abstractions funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1609.04085

Publication URI: https://arxiv.org/abs/1609.04085

Type: Other