Linear diophantine equations, group CSPs, and graph isomorphism

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 327-339, 2017.

Cited by: 8|Bibtex|Views3|Links
EI

Abstract:

In recent years, we have seen several approaches to the graph isomorphism problem based on \"generic\" mathematical programming or algebraic (Gröbner basis) techniques. For most of these, lower bounds have been established. In fact, it has been shown that the pairs of non-isomorphic CFI-graphs (introduced by Cai, Fürer, and Immerman in 19...More

Code:

Data:

Your rating :
0

 

Tags
Comments