Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.23345 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Atropos-k is PSPACE-complete
by: Yang, Chao, et al.
Published: (2024)
by: Yang, Chao, et al.
Published: (2024)
Maker-Maker games of rank 4 are PSPACE-complete
by: Galliot, Florian, et al.
Published: (2025)
by: Galliot, Florian, 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)
4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
by: Galliot, Florian
Published: (2025)
by: Galliot, Florian
Published: (2025)
Factorization norms and an inverse theorem for MaxCut
by: Balla, Igor, et al.
Published: (2025)
by: Balla, Igor, et al.
Published: (2025)
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
by: Johnson, Matthew, et al.
Published: (2022)
by: Johnson, Matthew, et al.
Published: (2022)
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
by: Armand, Jules, et al.
Published: (2025)
by: Armand, Jules, et al.
Published: (2025)
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
by: Bhargav, C. S., et al.
Published: (2025)
by: Bhargav, C. S., et al.
Published: (2025)
Is Graph Local Complementation Inherently Sequential?
by: Concha-Vega, Pablo
Published: (2025)
by: Concha-Vega, Pablo
Published: (2025)
How to Reconfigure Your Alliances
by: Fernau, Henning, et al.
Published: (2025)
by: Fernau, Henning, et al.
Published: (2025)
List Decoding Quotient Reed-Muller Codes
by: Gotlib, Omri, et al.
Published: (2025)
by: Gotlib, Omri, et al.
Published: (2025)
Property Testing in Bounded Degree Hypergraphs
by: Aaronson, Hugo, et al.
Published: (2025)
by: Aaronson, Hugo, et al.
Published: (2025)
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
by: Concha-Vega, Pablo, et al.
Published: (2025)
by: Concha-Vega, Pablo, et al.
Published: (2025)
On the Incompressibility of Truth With Application to Circuit Complexity
by: Tonon, Luke
Published: (2025)
by: Tonon, Luke
Published: (2025)
A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
by: Harary, Marc
Published: (2025)
by: Harary, Marc
Published: (2025)
On the complexity of freezing automata networks of bounded pathwidth
by: Goles, Eric, et al.
Published: (2025)
by: Goles, Eric, et al.
Published: (2025)
Enumeration With Nice Roman Domination Properties
by: Mann, Kevin
Published: (2025)
by: Mann, Kevin
Published: (2025)
A Distance Amplification Lemma for Monotonicity
by: Minzer, Dor
Published: (2025)
by: Minzer, Dor
Published: (2025)
Maximum Reachability Orientation of Mixed Graphs
by: Hörsch, Florian
Published: (2025)
by: Hörsch, Florian
Published: (2025)
Parameterized Complexity of Segment Routing
by: Bazgan, Cristina, et al.
Published: (2025)
by: Bazgan, Cristina, et al.
Published: (2025)
On the enumeration of Tarski fixed points
by: Müller, Julian
Published: (2023)
by: Müller, Julian
Published: (2023)
Edge-Disjoint Paths in Eulerian Digraphs
by: Cavallaro, Dario, et al.
Published: (2024)
by: Cavallaro, Dario, et al.
Published: (2024)
Relations between monotone complexity measures based on decision tree complexity
by: Byramji, Farzan, et al.
Published: (2024)
by: Byramji, Farzan, et al.
Published: (2024)
Gap Preserving Reductions Between Reconfiguration Problems
by: Ohsaka, Naoto
Published: (2022)
by: Ohsaka, Naoto
Published: (2022)
Computational complexity of the Weisfeiler-Leman dimension
by: Lichter, Moritz, et al.
Published: (2024)
by: Lichter, Moritz, et al.
Published: (2024)
Gap Amplification for Reconfiguration Problems
by: Ohsaka, Naoto
Published: (2023)
by: Ohsaka, Naoto
Published: (2023)
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
by: Marcille, Clara, et al.
Published: (2026)
by: Marcille, Clara, et al.
Published: (2026)
Enumerating Minimal Defensive Alliances
by: Feng, Zhidan, et al.
Published: (2023)
by: Feng, Zhidan, et al.
Published: (2023)
Counting Subgraphs in Somewhere Dense Graphs
by: Bressan, Marco, et al.
Published: (2022)
by: Bressan, Marco, et al.
Published: (2022)
Three Hardness Results for Graph Similarity Problems
by: Sun, He, et al.
Published: (2023)
by: Sun, He, et al.
Published: (2023)
Infinitely growing configurations in Emil Post's tag system problem
by: Kurilenko, Nikita V.
Published: (2021)
by: Kurilenko, Nikita V.
Published: (2021)
The Parameterized Complexity of Terminal Monitoring Set
by: Aravind, N. R., et al.
Published: (2024)
by: Aravind, N. R., et al.
Published: (2024)
Maximal Line Digraphs
by: Japhet, Quentin, et al.
Published: (2024)
by: Japhet, Quentin, et al.
Published: (2024)
Inapproximability of the independent set polynomial in the complex plane
by: Bezakova, Ivona, et al.
Published: (2017)
by: Bezakova, Ivona, et al.
Published: (2017)
Faster algorithms for graph homomorphism via tractable constraint satisfaction
by: Carbonnel, Clément
Published: (2026)
by: Carbonnel, Clément
Published: (2026)
$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
by: Rai, Ashutosh, et al.
Published: (2026)
by: Rai, Ashutosh, et al.
Published: (2026)
Optimal Inapproximability of Promise Equations over Finite Groups
by: Butti, Silvia, et al.
Published: (2024)
by: Butti, Silvia, et al.
Published: (2024)
Parallel Repetition for $3$-Player XOR Games
by: Bhangale, Amey, et al.
Published: (2024)
by: Bhangale, Amey, et al.
Published: (2024)
Complexity of Boolean automata networks under block-parallel update modes
by: Perrot, Kévin, et al.
Published: (2024)
by: Perrot, Kévin, et al.
Published: (2024)
On the equivalence of two post-quantum cryptographic families
by: Meneghetti, Alessio, et al.
Published: (2021)
by: Meneghetti, Alessio, et al.
Published: (2021)