Q6166682

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Supercritical size-width tree-like resolution trade-offs for graph isomorphism	2026-08-05	Paper
Computational complexity of the Weisfeiler-Leman dimension ACM Transactions on Computational Logic	2026-06-11	Paper
Computational complexity of the Weisfeiler-Leman dimension	2026-06-09	Paper
Canonization for bounded and dihedral color classes in choiceless polynomial time	2026-03-23	Paper
The iteration number of the Weisfeiler-Leman algorithm	2026-02-27	Paper
Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability	2026-02-19	Paper
Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements Journal of the ACM	2025-08-21	Paper
Compressing CFI graphs and lower bounds for the Weisfeiler-Leman refinements	2025-08-15	Paper
The iteration number of the Weisfeiler-Leman algorithm ACM Transactions on Computational Logic	2025-02-14	Paper
Choiceless polynomial time with witnessed symmetric choice Journal of the ACM	2025-02-06	Paper
Separating rank logic from polynomial time Journal of the ACM	2025-02-05	Paper
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm	2024-12-19	Paper
Choiceless polynomial time with witnessed symmetric choice	2024-12-06	Paper
Witnessed symmetric choice and interpretations in fixed-point logic with counting	2024-11-14	Paper
Continuing the quest for a logic capturing polynomial time -- potential, limitations, and interplay of current approaches	2024-10-30	Paper
Limitations of the invertible-map equivalences Journal Of Logic And Computation	2023-08-03	Paper
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting	2022-10-14	Paper
Choiceless Polynomial Time with Witnessed Symmetric Choice	2022-05-27	Paper
Separating Rank Logic from Polynomial Time	2021-04-27	Paper
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm	2019-05-08	Paper

Research outcomes over time

This page was built for person: