# A Multistage View on 2-Satisfiability

@inproceedings{Fluschnik2021AMV, title={A Multistage View on 2-Satisfiability}, author={Till Fluschnik}, booktitle={CIAC}, year={2021} }

We study $q$-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein, given a sequence of $q$-CNF fomulas and a non-negative integer $d$, the question is whether there is a sequence of satisfying truth assignments such that for every two consecutive truth assignments, the number of variables whose values changed is at most $d$. We prove that Multistage 2-SAT is NP-hard even in quite restricted cases. Moreover, we present parameterized algorithms (including kernelization… Expand

#### Figures from this paper

#### 3 Citations

Parameterized Algorithms for Diverse Multistage Problems

- Computer Science
- ESA
- 2021

This work introduces a framework allowing it to prove that a number of diverse multistage problems are fixed-parameter tractable by diversity, namely Perfect Matching, s-t Path, Matroid Independent Set, and Plurality Voting. Expand

Multistage Problems on a Global Budget

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2021

This work studies the different (time) layers of a temporal graph, and finds that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problemssuch as Matching. Expand

A General Approach to Approximate Multistage Subgraph Problems

- Computer Science
- ArXiv
- 2021

This work presents a framework that provides a (1/ √ 2χ)-approximation algorithm for the 2-stage restriction of an MSP if the similarity of subsequent solutions is measured as the intersection cardinality and said MSP is preficient, i.e., the authors can efficiently find a single-stage solution that prefers some given subset. Expand

#### References

SHOWING 1-10 OF 43 REFERENCES

Infeasibility of instance compression and succinct PCPs for NP

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 2011

There is no reduction from OR-SAT to any set A where the length of the output is bounded by a polynomial in n, unless NP@?coNP/poly, and the Polynomial-Time Hierarchy collapses. Expand

Infeasibility of instance compression and succinct PCPs for NP

- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2007

A new strong derandomization hypothesis is introduced, the Oracle Derandomization Hypothesis, and how it relates to traditional derandomizing assumptions is discussed, and various results about and connections between these variants are shown. Expand

Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

- Computer Science, Mathematics
- STOC '10
- 2010

It is shown that if satisfiability for n-variable d-CNF formulas has a protocol of cost O(nd-ε) then coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level. Expand

Which Problems Have Strongly Exponential Complexity

- Mathematics
- 2001

For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for these… Expand

On the complexity of K -SAT

- Mathematics
- 2001

The k-SAT problem is to determine if a given k-CNF has a satisfying assignment. It is a celebrated open question as to whether it requires exponential time to solve k-SAT for k?3. Here exponential… Expand

Strong computational lower bounds via parameterized complexity

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 2006

It is proved that the NP-hard distinguishing substring selection problem has no polynomial time approximation schemes of running time f(1/@e)n^o^(^1^/^@e^) for any function f unless an unlikely collapse occurs in parameterized complexity theory. Expand

On the Complexity of Timetable and Multicommodity Flow Problems

- Mathematics, Computer Science
- SIAM J. Comput.
- 1976

A very primitive version of Gotlieb’s timetable problem is shown to be NP-complete, and therefore all the common timetable problems are NP-complete. A polynomial time algorithm, in case all teachers… Expand

LP-based algorithms for multistage minimization problems

- Computer Science, Mathematics
- WAOA
- 2020

A new two-threshold rounding scheme, tailored for multistage problems, is introduced and it is shown that this rounding scheme gives a 2$f$-approximation algorithm for the multistages variant of the f-Set Cover problem, where each element belongs to at most f sets. Expand

Multistage Problems on a Global Budget

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2021

This work studies the different (time) layers of a temporal graph, and finds that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problemssuch as Matching. Expand

A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas

- Mathematics, Computer Science
- Inf. Process. Lett.
- 1979

A simple constructive algorithm for the evaluation of formulas having two literals per clause, which runs in linear time on a random access machine. Expand