Pages that link to "Item:Q3448781"
From MaRDI portal
The following pages link to Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781):
Displaying 8 items.
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- (Q4625692) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- (Q5091279) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability (Q6601300) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)