Describing finite groups by short first-order sentences-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Describing finite groups by short first-order sentences

Published:2017-09 Issue:1 Volume:221 Page:85-115
ISSN:0021-2172
Container-title:Israel Journal of Mathematics
language:en
Short-container-title:Isr. J. Math.

Author:

Nies André,Tent Katrin

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11856-017-1563-2.pdf

Reference12 articles.

1. L. Babai, A. J. Goodman, W. M. Kantor, E. M. Luks and P. P. Pálfy, Short presentations for finite groups, J. Algebra 194 (1997), 79–112.

2. L. Babai and E. Szemeredi, On the complexity of matrix group problems I, in Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984, IEEE Computer Society, Washington, DC, 1984, pp. 229–240.

3. S. R. Blackburn, P. M. Neumann and G. Venkataraman, Enumeration of Finite Groups, Cambridge Tracts in Mathematics, Vol. 173, Cambridge University Press, Cambridge, 2007.

4. J. N. Bray, M. D. E. Conder, C. R. Leedham-Green and E. A. O’Brien, Short presentations for alternating and symmetric groups, Trans. Amer. Math. Soc. 363 (2011), 3277–3285.

5. H. Buhrman, M. Li, J. Tromp and P. Vitányi, Kolmogorov random graphs and the incompressibility method, SIAM J. Comput. 29 (1999), 590–599.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03

2. On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-30

3. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023

4. On the Weisfeiler-Leman Dimension of Finite Groups;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

5. Algorithmic search in group theory;Journal of Algebra;2020-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3