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, that ar...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Logical Methods in Computer Science e.V.
2005-03-01
|
| Reeks: | Logical Methods in Computer Science |
| Onderwerpen: | |
| Online toegang: | https://lmcs.episciences.org/2272/pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|