Saved in:
| Main Authors: | Calderoni, Luca, Margara, Luciano, Marzolla, Moreno |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2003.01591 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021)
by: Calderoni, Luca, et al.
Published: (2021)
Constant Degree Direct Product Testers with Small Soundness
by: Bafna, Mitali, et al.
Published: (2024)
by: Bafna, Mitali, et al.
Published: (2024)
King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026)
by: Li, Chao, et al.
Published: (2026)
On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)
by: Chakraborty, Somnath
Published: (2023)
Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)
by: Delépine, Thomas
Published: (2026)
Testing Isomorphism of Graphs in Polynomial Time
by: Xue, Rui
Published: (2023)
by: Xue, Rui
Published: (2023)
Computing the EHZ capacity is NP-hard
by: Leipold, Karla, et al.
Published: (2024)
by: Leipold, Karla, et al.
Published: (2024)
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
by: Mondada, Luca, et al.
Published: (2023)
by: Mondada, Luca, et al.
Published: (2023)
A Note on the Complexity of Directed Clique
by: Gutowski, Grzegorz, et al.
Published: (2026)
by: Gutowski, Grzegorz, et al.
Published: (2026)
Computing eulerian magnitude homology
by: Menara, Giuliamaria, et al.
Published: (2024)
by: Menara, Giuliamaria, et al.
Published: (2024)
On the hardness of recognizing graphs of small mim-width and its variants
by: la Tour, Max Dupré, et al.
Published: (2025)
by: la Tour, Max Dupré, et al.
Published: (2025)
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
by: Ikenmeyer, Christian, et al.
Published: (2022)
by: Ikenmeyer, Christian, et al.
Published: (2022)
Interactive Proofs For Distribution Testing With Conditional Oracles
by: Biswas, Ari, et al.
Published: (2025)
by: Biswas, Ari, et al.
Published: (2025)
Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
by: Li, Xin, et al.
Published: (2023)
by: Li, Xin, et al.
Published: (2023)
Lions and Contamination: Trees and General Graphs
by: Kim, Dohoon, et al.
Published: (2026)
by: Kim, Dohoon, et al.
Published: (2026)
On a Hierarchy of Spectral Invariants for Graphs
by: Arvind, V., et al.
Published: (2023)
by: Arvind, V., et al.
Published: (2023)
On the Structure of Hamiltonian Graphs with Small Independence Number
by: Jedličková, Nikola, et al.
Published: (2024)
by: Jedličková, Nikola, et al.
Published: (2024)
Communication Complexity of Disjointness under Product Distributions
by: Hunter, Zach, et al.
Published: (2026)
by: Hunter, Zach, et al.
Published: (2026)
Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
by: Eagling-Vose, Tala, et al.
Published: (2025)
by: Eagling-Vose, Tala, et al.
Published: (2025)
A Subexponential Reduction from Product Partition to Subset Sum
by: Costandin, Marius
Published: (2024)
by: Costandin, Marius
Published: (2024)
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
by: Baril, Ambroise, et al.
Published: (2024)
by: Baril, Ambroise, et al.
Published: (2024)
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
by: Hsieh, Jun-Ting, et al.
Published: (2024)
by: Hsieh, Jun-Ting, et al.
Published: (2024)
Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
by: Hellmuth, Marc, et al.
Published: (2023)
by: Hellmuth, Marc, et al.
Published: (2023)
Hierarchies of Minion Tests for PCSPs through Tensors
by: Ciardo, Lorenzo, et al.
Published: (2022)
by: Ciardo, Lorenzo, et al.
Published: (2022)
Reconfiguring Graph Homomorphisms on the Sphere
by: Lee, Jae-Baek, et al.
Published: (2018)
by: Lee, Jae-Baek, et al.
Published: (2018)
Determining the Outerthickness of Graphs Is NP-Hard
by: Lee, Pin-Hsian, et al.
Published: (2026)
by: Lee, Pin-Hsian, et al.
Published: (2026)
Graph Irregularity via Edge Deletions
by: Bensmail, Julien, et al.
Published: (2025)
by: Bensmail, Julien, et al.
Published: (2025)
The Interplay Between Domination and Separation in Graphs
by: Chakraborty, Dipayan, et al.
Published: (2026)
by: Chakraborty, Dipayan, et al.
Published: (2026)
Complexity Aspects of Homomorphisms of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)
by: Čertík, Michal, et al.
Published: (2025)
On Computational Aspects of Cores of Ordered Graphs
by: Čertík, Michal, et al.
Published: (2025)
by: Čertík, Michal, et al.
Published: (2025)
Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)
by: Kunisky, Dmitriy, et al.
Published: (2024)
Testing Sumsets is Hard
by: Chen, Xi, et al.
Published: (2024)
by: Chen, Xi, et al.
Published: (2024)
Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
by: Dikstein, Yotam, et al.
Published: (2024)
by: Dikstein, Yotam, et al.
Published: (2024)
Hardness of 4-Colourings G-Colourable Graphs
by: Avvakumov, Sergey, et al.
Published: (2025)
by: Avvakumov, Sergey, et al.
Published: (2025)
Finding d-Cuts in Claw-free Graphs
by: Ahn, Jungho, et al.
Published: (2025)
by: Ahn, Jungho, et al.
Published: (2025)
Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
by: Concha-Vega, Pablo
Published: (2026)
by: Concha-Vega, Pablo
Published: (2026)
Finding Minimum Matching Cuts in $H$-free Graphs
by: Lucke, Felicia, et al.
Published: (2025)
by: Lucke, Felicia, et al.
Published: (2025)
Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
by: Lucke, Felicia
Published: (2025)
by: Lucke, Felicia
Published: (2025)
Algorithmic methods of finite discrete structures. Graph clique problem
by: Kurapov, Sergey, et al.
Published: (2024)
by: Kurapov, Sergey, et al.
Published: (2024)
Characterizing and Testing Principal Minor Equivalence of Matrices
by: Chatterjee, Abhranil, et al.
Published: (2024)
by: Chatterjee, Abhranil, et al.
Published: (2024)
Similar Items
-
A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021) -
Constant Degree Direct Product Testers with Small Soundness
by: Bafna, Mitali, et al.
Published: (2024) -
King Chasing Problem in Chinese Chess is NP-hard
by: Li, Chao, et al.
Published: (2026) -
On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023) -
Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)