For computations with coherent configurations
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Improved Bounds for the Crossing Numbers of Km,n and Kn
SIAM Journal on Discrete Mathematics
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
New code upper bounds from the Terwilliger algebra and semidefinite programming
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We present a GAP package for computing with Schurian coherent configurations and their representations.