Image de couverture de livre

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Oliveria, Mateus de Oliveira, Urmian, Sam
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Logic in Computer Science Combinatorics 68R10, 68W40, 05C85, 68Q60, 03B70, 68Q27 F.2.2; G.2.2; F.4.1; I.2.3; G.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
par: Golovach, Petr A., et autres
Publié: (2022)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
par: Oliveira, Mateus de Oliveira, et autres
Publié: (2026)

DAG Scheduling in the BSP Model
par: Papp, Pál András, et autres
Publié: (2023)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
par: Opris, Andre, et autres
Publié: (2024)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
par: Bodirsky, Manuel, et autres
Publié: (2024)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
par: Cojocaru, Liliana
Publié: (2015)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
par: Dorochko, Leonid, et autres
Publié: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
par: Opris, Andre
Publié: (2025)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
par: Bodirsky, Manuel, et autres
Publié: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

Amnesiac Flooding: Easy to break, hard to escape
par: Austin, Henry, et autres
Publié: (2025)

Separate Before You Compress: The WWHO Tokenization Architecture
par: Darshana, Kusal
Publié: (2026)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
par: Forster, Jonas, et autres
Publié: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
par: Levet, Michael, et autres
Publié: (2023)

Behavioural Conformances based on Lax Couplings
par: Wild, Paul, et autres
Publié: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma
par: Mourad, Daniel
Publié: (2024)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
par: Huber, Michael Kiran
Publié: (2024)

Pure Data Spaces
par: Youssef, Saul
Publié: (2025)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
par: Haslebacher, Sebastian
Publié: (2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
par: Bannach, Max, et autres
Publié: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Dependence and Independence for Reversible Process Calculi
par: Aubert, Clément, et autres
Publié: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
par: Haak, Anselm, et autres
Publié: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

Solutions of Word Equations over Partially Commutative Structures
par: Diekert, Volker, et autres
Publié: (2016)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)

Locality, Consistency, and the Tractability Frontier
par: Simas, Tristan
Publié: (2026)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Heaven & Hell II: Scale Laws and Robustness in One-Step Heaven-Hell Consensus
par: Aghanya, Nnamdi Daniel, et autres
Publié: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
par: Opris, Andre
Publié: (2025)