Pages that link to "Item:Q5898822"
From MaRDI portal
The following pages link to Logical Approaches to Computational Barriers (Q5898822):
Displaying 7 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
