Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Babai, L��szl��"'
The codewords of the homomorphism code $\operatorname{aHom}(G,H)$ are the affine homomorphisms between two finite groups, $G$ and $H$, generalizing Hadamard codes. Following the work of Goldreich--Levin (1989), Grigorescu et al. (2006), Dinur et al.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d570478f5448aaf81ba92e9639fc0ff5
http://arxiv.org/abs/1806.02969
http://arxiv.org/abs/1806.02969
Autor:
Babai, L��szl��
We show that the Graph Isomorphism (GI) problem and the related problems of String Isomorphism (under group action) (SI) and Coset Intersection (CI) can be solved in quasipolynomial ($\exp((\log n)^{O(1)})$) time. The best previous bound for GI was $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d417821c54ef57de5d2eb3cff2c85e8
Autor:
Babai, L��szl��, Wilmes, John
We give a new bound on the parameter $��$ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph $G$, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014). The new boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::145910e059d9af09005a6fded1223e90
Autor:
Babai, L��szl��, Seress, ��kos
In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^��$ then some non-identity powe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c1e7e8c3f4e380cf249be1640f4d9c1