Imagen de Portada

Computational complexity of the Weisfeiler-Leman dimension

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lichter, Moritz, Raßmann, Simon, Schweitzer, Pascal
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
por: Grohe, Martin, et al.
Publicado: (2023)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

An Upper Bound on the Weisfeiler-Leman Dimension
por: Schneider, Thomas, et al.
Publicado: (2024)

The Iteration Number of the Weisfeiler-Leman Algorithm
por: Grohe, Martin, et al.
Publicado: (2023)

The Weisfeiler-Leman Dimension of Conjunctive Queries
por: Göbel, Andreas, et al.
Publicado: (2023)

Relations between monotone complexity measures based on decision tree complexity
por: Byramji, Farzan, et al.
Publicado: (2024)

Inapproximability of the independent set polynomial in the complex plane
por: Bezakova, Ivona, et al.
Publicado: (2017)

On the complexity of freezing automata networks of bounded pathwidth
por: Goles, Eric, et al.
Publicado: (2025)

Weisfeiler-Leman at the margin: When more expressivity matters
por: Franks, Billy J., et al.
Publicado: (2024)

On the complexity of the Maker-Breaker happy vertex game
por: Hilaire, Mathieu, et al.
Publicado: (2026)

On the parameterized complexity of the Maker-Breaker domination game
por: Bagan, Guillaume, et al.
Publicado: (2026)

More efficient sifting for grid norms, and applications to multiparty communication complexity
por: Kelley, Zander, et al.
Publicado: (2025)

On Computational Aspects of Ordered Matching Problems
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 Complexity of Covering Two-vertex Multigraphs with Semi-edges
por: Bok, Jan, et al.
Publicado: (2021)

Complexity of Injectivity and Verification of ReLU Neural Networks
por: Froese, Vincent, et al.
Publicado: (2024)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
por: Kiefer, Sandra, et al.
Publicado: (2024)

Edge-Disjoint Paths in Eulerian Digraphs
por: Cavallaro, Dario, et al.
Publicado: (2024)

The Parameterized Complexity of Terminal Monitoring Set
por: Aravind, N. R., et al.
Publicado: (2024)

Maximal Line Digraphs
por: Japhet, Quentin, et al.
Publicado: (2024)

Optimal Inapproximability of Promise Equations over Finite Groups
por: Butti, Silvia, et al.
Publicado: (2024)

Parallel Repetition for $3$-Player XOR Games
por: Bhangale, Amey, et al.
Publicado: (2024)

Complexity of Boolean automata networks under block-parallel update modes
por: Perrot, Kévin, et al.
Publicado: (2024)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
por: Armand, Jules, et al.
Publicado: (2025)

On the enumeration of Tarski fixed points
por: Müller, Julian
Publicado: (2023)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
por: Bhargav, C. S., et al.
Publicado: (2025)

Gap Preserving Reductions Between Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2022)

Gap Amplification for Reconfiguration Problems
por: Ohsaka, Naoto
Publicado: (2023)

Is Graph Local Complementation Inherently Sequential?
por: Concha-Vega, Pablo
Publicado: (2025)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

Enumerating Minimal Defensive Alliances
por: Feng, Zhidan, et al.
Publicado: (2023)

Counting Subgraphs in Somewhere Dense Graphs
por: Bressan, Marco, et al.
Publicado: (2022)

Three Hardness Results for Graph Similarity Problems
por: Sun, He, et al.
Publicado: (2023)

How to Reconfigure Your Alliances
por: Fernau, Henning, et al.
Publicado: (2025)

List Decoding Quotient Reed-Muller Codes
por: Gotlib, Omri, et al.
Publicado: (2025)

Property Testing in Bounded Degree Hypergraphs
por: Aaronson, Hugo, et al.
Publicado: (2025)

Infinitely growing configurations in Emil Post's tag system problem
por: Kurilenko, Nikita V.
Publicado: (2021)

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
por: Concha-Vega, Pablo, et al.
Publicado: (2025)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
por: Carbonnel, Clément
Publicado: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
por: Rai, Ashutosh, et al.
Publicado: (2026)