Cover Image

Experimental algorithms for the dualization problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mezzini, Mauro, Gomez, Fernando Cuartero, Gonzalez, Jose Javier Paulet, Calvo, Hernan Indibil de la Cruz, Pascual, Vicente, Pelayo, Fernando L.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 68Q25, 68R10 F.2.2; I.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

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

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
by: Keil, J. Mark, et al.
Published: (2024)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
by: Kosoy, Vanessa
Published: (2026)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

On weighted graph separation problems and flow-augmentation
by: Kim, Eun Jung, et al.
Published: (2022)

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

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

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

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

Logarithmic Weisfeiler--Leman and Treewidth
by: Levet, Michael, et al.
Published: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
by: Levet, Michael, et al.
Published: (2023)

Overlapping Biclustering
by: Bentert, Matthias, et al.
Published: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
by: Kullmann, Oliver, et al.
Published: (2026)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Optimal non-adaptive algorithm for edge estimation
by: Bishnu, Arijit, et al.
Published: (2025)

Testing forbidden order-pattern properties on hypergrids
by: Chandramouleeswaran, Harish, et al.
Published: (2025)

A Faster Algorithm for Independent Cut
by: Chernyshev, Vsevolod, et al.
Published: (2025)

Binary Tree Block Encoding of Classical Matrix
by: Li, Zexian, et al.
Published: (2025)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, 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)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
by: Bojikian, Narek, et al.
Published: (2025)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

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

Tensor Decomposition for Non-Clifford Gate Minimization
by: Khoruzhii, Kirill, et al.
Published: (2026)

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

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

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

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

$XX^{t}$ Can Be Faster
by: Rybin, Dmitry, et al.
Published: (2025)

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

Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)

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

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

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)