首页 | 本学科首页   官方微博 | 高级检索  
     


On the fixed-parameter tractability of parameterized model-checking problems
Authors:Iain A. Stewart
Affiliation:Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, UK
Abstract:In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied.
Keywords:Computational complexity   Analysis of algorithms   Fixed-parameter tractability
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号