Cover Image

Algorithms Transcending the SAT-Symmetry Interface

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anders, Markus, Schweitzer, Pascal, Soos, Mate
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms 68W01
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

satsuma: Structure-based Symmetry Breaking in SAT
by: Anders, Markus, et al.
Published: (2024)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Independent Set Reconfiguration Under Bounded-Hop Token
by: Hatano, Hiroki, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Notes on Randomized Algorithms
by: Aspnes, James
Published: (2020)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

On the Advice Complexity of Online Unit Clustering
by: Nagy-György, Judit
Published: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
by: Bai, Miao, et al.
Published: (2023)

On Distributed Colouring of Hyperbolic Random Graphs
by: Maus, Yannic, et al.
Published: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
by: Lynch, Nancy
Published: (2024)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
by: Gribelyuk, Elena, et al.
Published: (2024)

The Telephone $k$-Multicast Problem
by: Hathcock, Daniel, et al.
Published: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
by: Hung, Chia-Yang, et al.
Published: (2024)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2025)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
by: Chiclana, Rafael, et al.
Published: (2025)

Optimizing Exact String Matching via Statistical Anchoring
by: Garraoui, Omar
Published: (2025)

Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

Strengths and Limitations of Greedy in Cup Games
by: Jasińska, Kalina, et al.
Published: (2026)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
by: Coşa, Matei Gabriel, et al.
Published: (2025)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

The Berlekamp-Massey Algorithm revisited
by: Atti, Nadia Ben, et al.
Published: (2022)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
by: Nasre, Meghana, et al.
Published: (2023)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
by: Gupta, Swati, et al.
Published: (2022)

String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)