Cover Image

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sølvsten, Steffan Christ, van de Pol, Jaco
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms 68R10 (Primary) 68W30, 68Q60, 68U99 (Secondary) E.1; E.5; F.2.2; F.2.1; I.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2024)

Symbolic Model Checking in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
by: Alpay, Faruk, et al.
Published: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

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

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

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

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

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
by: Prior, Morgan E., et al.
Published: (2023)

Algorithms for Generating Small Random Samples
by: Cicirello, Vincent A.
Published: (2024)

The Quasi-probability Method and Applications for Trace Reconstruction
by: Rubinstein, Ittai
Published: (2024)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
by: Cicirello, Vincent A.
Published: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
by: Gouvine, Gabriel
Published: (2023)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
by: Bell, Tolson, et al.
Published: (2024)

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

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
by: Conradi, Jacobus, et al.
Published: (2023)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
by: Saffidine, Abdallah, et al.
Published: (2025)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
by: Koiran, Pascal, et al.
Published: (2022)