Image de couverture de livre

Tight complexity bounds for diagram commutativity verification

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Malko, Artem, Spiridonov, Igor
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Category Theory 05C85, 68Q25, 68Q17 (Primary) 68R10, 68W05, 18A10 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
par: Abdullah, Duaa, et autres
Publié: (2025)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
par: Grippo, Luciano N., et autres
Publié: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
par: Roucairol, Milo, et autres
Publié: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
par: Goedgebeur, Jan, et autres
Publié: (2024)

On 3-colorability of (claw, diamond)-free graphs
par: Hodur, Nadzieja, et autres
Publié: (2026)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
par: Hommelsheim, Felix
Publié: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
par: Basson, Dirk, et autres
Publié: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
par: Gamarnik, David, et autres
Publié: (2025)

Perfecting the Line Graph
par: Bal, Hartosh Singh
Publié: (2025)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
par: Gollin, J. Pascal, et autres
Publié: (2023)

Algorithmic releases on the spanning trees of suitable graphs
par: Imbesi, Maurizio, et autres
Publié: (2017)

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

The Upper Clique Transversal Problem
par: Milanič, Martin, et autres
Publié: (2023)

A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality
par: Logsdon, Sara, et autres
Publié: (2024)

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

Fundamentals of Partial Rejection Sampling
par: Jerrum, Mark
Publié: (2021)

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

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Finding cliques and dense subgraphs using edge queries
par: Csóka, Endre, et autres
Publié: (2023)

Haar Wavelets, Gradients and Approximate TV Regularization
par: Sauer, Tomas, et autres
Publié: (2022)

Commutator-free Cayley methods
par: Maslovskaya, Sofya, et autres
Publié: (2024)

A Second-Order TGV Discretization with $90^{\circ}$ Rotational Invariance Property
par: Hosseini, Alireza, et autres
Publié: (2022)

Dead Zones Enable Flexible Phase Organization in Coupled Oscillators
par: Akhavan, Naghmeh, et autres
Publié: (2026)

Mixed finite element methods for linear Cosserat equations
par: Boon, Wietse Marijn, et autres
Publié: (2024)

Entropy stable finite difference methods via entropy correction artificial viscosity and knapsack limiting
par: Christner, Brian, et autres
Publié: (2025)

A space-time dual-pairing summation-by-parts framework for forward and adjoint wave equations
par: Wiratama, Kenny, et autres
Publié: (2026)

Robust First and Second-Order Differentiation for Regularized Optimal Transport
par: Li, Xingjie, et autres
Publié: (2024)

An Efficient Two-Sided Sketching Method for Large-Scale Tensor Decomposition Based on Transformed Domains
par: Cheng, Zhiguang, et autres
Publié: (2024)

Gripenberg-like algorithm for the lower spectral radius
par: Guglielmi, Nicola, et autres
Publié: (2024)

A study of ferronematic thin films including a stray field energy
par: Dutta, Shilpa, et autres
Publié: (2025)

PCA++: How Uniformity Induces Robustness to Background Noise in Contrastive Learning
par: Wu, Mingqi, et autres
Publié: (2025)

Scattering from a random thin coating of nanoparticles: the Dirichlet case
par: Boucart, Amandine, et autres
Publié: (2025)

Micro-Macro Coupling for Optimizing Scaffold Mediated Bone Regeneration
par: Dondl, Patrick, et autres
Publié: (2025)

Edge open packing: complexity, algorithmic aspects, and bounds
par: Brešar, Boštjan, et autres
Publié: (2024)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
par: Li, Xingfu
Publié: (2026)

A Note on Graph Burning of Path Forests
par: Tan, Ta Sheng, et autres
Publié: (2023)

Shortest Paths in a Weighted Simplicial Complex
par: Chakraborty, Sukrit, et autres
Publié: (2025)

Computational complexity of counting coincidences
par: Chan, Swee Hong, et autres
Publié: (2023)