BIROn - Birkbeck Institutional Research Online

    Almost 2-SAT is fixed-parameter tractable (extended abstract)

    Razgon, Igor and O’Sullivan, B. (2008) Almost 2-SAT is fixed-parameter tractable (extended abstract). In: Aceto, L. and Damgård, I. and Goldberg, L.A. and Halldórsson, M.M. and Ingólfsdóttir, A. and Walukiewicz, I. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science 5125. Berlin, Germany: Springer Verlag, pp. 551-562. ISBN 9783540705758.

    Full text not available from this repository.

    Abstract

    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(15 k *k*m 3) time showing that this problem is fixed-parameter tractable.

    Metadata

    Item Type: Book Section
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Sarah Hall
    Date Deposited: 01 Aug 2013 16:14
    Last Modified: 09 Aug 2023 12:34
    URI: https://eprints.bbk.ac.uk/id/eprint/7931

    Statistics

    Activity Overview
    6 month trend
    0Downloads
    6 month trend
    228Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item