Pages that link to "Item:Q1159699"
From MaRDI portal
The following pages link to Concerning the complexity of deciding isomorphism of block designs (Q1159699):
Displaying 5 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Latin directed triple systems (Q658105) (← links)
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique (Q1198063) (← links)
- Coined quantum walks lift the cospectrality of graphs and trees (Q2270832) (← links)
- The complexity of computing the automorphism group of automata and related problems (Q3811719) (← links)