Fixed-parameter decidability: Extending parameterized complexity analysis
We extend the reach of fixed‐parameter analysis by introducing classes of parameterized sets defined based on decidability instead of complexity. Known results in computability theory can be expressed in the language of fixed‐parameter analysis, making use of the landscape of these new classes. On t...
Saved in:
| Published in: | Mathematical logic quarterly Vol. 62; no. 6; pp. 596 - 607 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin
Blackwell Publishing Ltd
01.12.2016
Wiley Subscription Services, Inc |
| Subjects: | |
| ISSN: | 0942-5616, 1521-3870 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!