A multistage view on 2-satisfiability
From MaRDI portal
Publication:2692727
DOI10.1007/978-3-030-75242-2_16OpenAlexW3164377310MaRDI QIDQ2692727
Publication date: 22 March 2023
Full work available at URL: https://arxiv.org/abs/2011.02325
Related Items (3)
Multistage vertex cover ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ A simple rounding scheme for multistage optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum sum of diameters clustering
- Infeasibility of instance compression and succinct PCPs for NP
- Strong computational lower bounds via parameterized complexity
- On the parameterized complexity of multiple-interval graph problems
- On problems without polynomial kernels
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Which problems have strongly exponential complexity?
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Parametrized complexity theory.
- Single bend wiring
- On the Complexity of Timetable and Multicommodity Flow Problems
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
- Reducibility among Combinatorial Problems
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Parameterized Algorithms
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
- The complexity of theorem-proving procedures
- Multistage Vertex Cover
- On the complexity of \(k\)-SAT
This page was built for publication: A multistage view on 2-satisfiability
