:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Calderoni, Luca, Margara, Luciano, Marzolla, Moreno
Formato:	Preprint
Publicado:	2020
Materias:	Computational Complexity Combinatorics
Acceso en línea:	https://arxiv.org/abs/2003.01591
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Heuristic for Direct Product Graph Decomposition
por: Calderoni, Luca, et al.
Publicado: (2021)

Constant Degree Direct Product Testers with Small Soundness
por: Bafna, Mitali, et al.
Publicado: (2024)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

On hardness of computing analytic Brouwer degree
por: Chakraborty, Somnath
Publicado: (2023)

Between proper and square coloring of planar graphs, hardness and extremal graphs
por: Delépine, Thomas
Publicado: (2026)

Testing Isomorphism of Graphs in Polynomial Time
por: Xue, Rui
Publicado: (2023)

Computing the EHZ capacity is NP-hard
por: Leipold, Karla, et al.
Publicado: (2024)

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
por: Mondada, Luca, et al.
Publicado: (2023)

A Note on the Complexity of Directed Clique
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Computing eulerian magnitude homology
por: Menara, Giuliamaria, et al.
Publicado: (2024)

On the hardness of recognizing graphs of small mim-width and its variants
por: la Tour, Max Dupré, et al.
Publicado: (2025)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
por: Ikenmeyer, Christian, et al.
Publicado: (2022)

Interactive Proofs For Distribution Testing With Conditional Oracles
por: Biswas, Ari, et al.
Publicado: (2025)

Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
por: Li, Xin, et al.
Publicado: (2023)

Lions and Contamination: Trees and General Graphs
por: Kim, Dohoon, et al.
Publicado: (2026)

On a Hierarchy of Spectral Invariants for Graphs
por: Arvind, V., et al.
Publicado: (2023)

On the Structure of Hamiltonian Graphs with Small Independence Number
por: Jedličková, Nikola, et al.
Publicado: (2024)

Communication Complexity of Disjointness under Product Distributions
por: Hunter, Zach, et al.
Publicado: (2026)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

A Subexponential Reduction from Product Partition to Subset Sum
por: Costandin, Marius
Publicado: (2024)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

Hierarchies of Minion Tests for PCSPs through Tensors
por: Ciardo, Lorenzo, et al.
Publicado: (2022)

Reconfiguring Graph Homomorphisms on the Sphere
por: Lee, Jae-Baek, et al.
Publicado: (2018)

Determining the Outerthickness of Graphs Is NP-Hard
por: Lee, Pin-Hsian, et al.
Publicado: (2026)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

The Interplay Between Domination and Separation in Graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2026)

Complexity Aspects of Homomorphisms of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

On Computational Aspects of Cores of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Testing Sumsets is Hard
por: Chen, Xi, et al.
Publicado: (2024)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
por: Dikstein, Yotam, et al.
Publicado: (2024)

Hardness of 4-Colourings G-Colourable Graphs
por: Avvakumov, Sergey, et al.
Publicado: (2025)

Finding d-Cuts in Claw-free Graphs
por: Ahn, Jungho, et al.
Publicado: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

Finding Minimum Matching Cuts in $H$-free Graphs
por: Lucke, Felicia, et al.
Publicado: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
por: Lucke, Felicia
Publicado: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Characterizing and Testing Principal Minor Equivalence of Matrices
por: Chatterjee, Abhranil, et al.
Publicado: (2024)