The following pages link to (Q3396558):
Displayed 12 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- On the complexity of matroid isomorphism problem (Q639843) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs (Q2030268) (← links)
- A fast Fourier transform for the Johnson graph (Q2154368) (← links)
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism'' (Q2282762) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- From Invariants to Canonization in Parallel (Q3503640) (← links)
- Lorentzian spectral geometry with causal sets (Q5162473) (← links)
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating (Q6158565) (← links)