Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 5 of 7
1. Verfasser: Kim, Eun Jung (VerfasserIn)
Weitere Verfasser: Kratsch, Stefan (VerfasserIn), Pilipczuk, Marcin (VerfasserIn), Wahlström, Magnus (VerfasserIn)
Pages:2023
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2023
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Graph Classes with Few Minimal Separators. II. A Dichotomy 2023 Gartland, Peter
Almost Consistent Systems of Linear Equations 2023 Dabrowski, Konrad K.
Deterministic Counting Lovász Local Lemma beyond Linear Programming 2023 He, Kun
Improved Bounds for Sampling Solutions of Random CNF Formulas 2023 He, Kun
Instability of Backoff Protocols with Arbitrary Arrival Rates 2023 Goldberg, Leslie Ann
Non-Stochastic CDF Estimation Using Threshold Queries 2023 Okoroafor, Princewill
Higher Degree Sum-of-Squares Relaxations Robust against Oblivious Outliers 2023 d'Orsi, Tommaso
Fixed-Parameter Tractability of Maximum Colored Path and Beyond 2023 Fomin, Fedor V.
Sparse Graphs with Bounded Induced Cycle Packing Number Have Logarithmic Treewidth 2023 Bonamy, Marthe
Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs 2023 Belova, Tatiana
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints 2023 Kim, Eun Jung
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT 2023 Chen, Zongchen
Interactive Coding with Small Memory 2023 Efremenko, Klim
Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage 2023 Jain, Pallavi
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes 2023 Golovach, Petr A.
Parameterized Algorithm for the Disjoint Path Problem on Planar Graphs: Exponential in k2 and Linear in n∗† 2023 Cho, Kyungjin
Constant Approximating Parameterized k-SetCover is W[2]-Hard 2023 Lin, Bingkai
Subexponential Mixing for Partition Chains on Grid-Like Graphs 2023 Frieze, Alan
Moser-Tardos Algorithm: Beyond Shearer's Bound 2023 He, Kun
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs 2023 Focke, Jacob
Alle Artikel auflisten