BIROn - Birkbeck Institutional Research Online

    Almost 2-SAT is fixed-parameter tractable

    Razgon, Igor and O'Sullivan, B. (2009) Almost 2-SAT is fixed-parameter tractable. Journal of Computer and System Sciences 75 (8), pp. 435-450. ISSN 0022-0000.

    Full text not available from this repository.


    We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-standing open question in the area of parameterized complexity. We resolve this open question by proposing an algorithm that solves this problem in O(k15×k×m3)O(15k×k×m3) time showing that this problem is fixed-parameter tractable.


    Item Type: Article
    Keyword(s) / Subject(s): Fixed-parameter algorithms, Satisfiability problems, Separation problems
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 11 Jun 2013 12:35
    Last Modified: 11 Jun 2013 12:35


    Activity Overview

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item