Model-Checking Problems as a Basis for Parameterized Intractability

Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form. But there are also classes, for example, the A-hierarchy, th...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 1, Issue 1
Main Authors:	Flum, Joerg, Grohe, Martin
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 07.03.2005
Subjects:	computer science - computational complexity computer science - logic in computer science f.1.3 f.4.1
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!