:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	Standish, Russell K.
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity 94A17, 05C30 G.2.2
Online Access:	https://arxiv.org/abs/2604.16327
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
by: Lobe, Elisabeth, et al.
Published: (2021)

Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
by: Goldberg, Guy, et al.
Published: (2025)

DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)

On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)

Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem
by: Riis, Søren
Published: (2026)

On the Negation of a Hyperbolic-Valued Probability Distribution
by: Bory-Reyes, Juan, et al.
Published: (2026)

Label propagation on binomial random graphs
by: Kiwi, Marcos, et al.
Published: (2023)

On the parameterized complexity of computing good edge-labelings
by: de Andrade, Davi, et al.
Published: (2024)

Lesche stability of the Shannon strong hyperbolic entropy and some hyperbolic extensions
by: Belman, Juan Adrián Ramírez, et al.
Published: (2026)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
by: Riis, Søren
Published: (2026)

How Does Machine Learning Manage Complexity?
by: Fortnow, Lance
Published: (2026)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
by: Bhandari, Kritika, et al.
Published: (2025)

Computational Complexity of Physical Counting
by: Simas, Tristan
Published: (2026)

Complexity of graph evolutions
by: Gao, Jeffrey, et al.
Published: (2024)

Sphere packing proper colorings of an expander graph
by: Zhu, Honglin
Published: (2024)

On the number of Hamiltonian cycles in the generalized Petersen graph
by: Haugland, Jan Kristian
Published: (2025)

A Fiber Criterion for Representation Identifiability in Supervised Learning
by: Sevetlidis, Vasileios
Published: (2026)

Asymptotic Semantic Collapse in Hierarchical Optimization
by: Alpay, Faruk, et al.
Published: (2026)

Dominic Welsh: his work and influence
by: Farr, Graham, et al.
Published: (2024)

Submodular Benchmark Selection
by: Smola, Alexander
Published: (2026)

Term Coding for Extremal Combinatorics: Dispersion and Complexity Dichotomies
by: Riis, Søren
Published: (2025)

XALP-completeness of Parameterized Problems on Planar Graphs
by: Bodlaender, Hans L., et al.
Published: (2024)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
by: Bougeret, Marin, et al.
Published: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
by: Bougeret, Marin, et al.
Published: (2025)

Graph Iterative Filtering methods for the analysis of nonstationary signals on graphs
by: Scarlato, Giuseppe, et al.
Published: (2026)

On roots of domination polynomials for friendship and book graphs
by: Rather, Bilal Ahmad
Published: (2026)

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2023)

On the number of spanning trees of bicirculant graphs
by: Yang, Jing, et al.
Published: (2026)

The number of rooted spanning forests of bicirculant graphs
by: Yang, Jing, et al.
Published: (2025)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Human Supervision as an Information Bottleneck: A Unified Theory of Error Floors in Human-Guided Learning
by: Dominguez, Alejandro Rodriguez
Published: (2026)

Representing polynomial of ST-CONNECTIVITY
by: Iraids, Jānis, et al.
Published: (2021)

Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)

An Algebraic Rigidity Framework for Order-Oblivious Deterministic Black-Box PIT of ROABPs
by: Singh, Shalender, et al.
Published: (2026)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)

An improved bound for 2-distance coloring of planar graphs with girth six
by: Deniz, Zakir
Published: (2022)

Bandwidth-Efficient Multi-Agent Communication through Information Bottleneck and Vector Quantization
by: Farooq, Ahmad, et al.
Published: (2026)