The minimum-length generator sequence problem is NP-hard-Reference-Cited by-同舟云学术

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

The minimum-length generator sequence problem is NP-hard

Published:1981-09 Issue:3 Volume:2 Page:311-313
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Even S,Goldreich O

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference5 articles.

1. Isomorphism of graphs of bounded valence can be tested in polynomial time;Luks,1980

2. Notes on the ‘Magic Cube’;Singmaster,1980

3. Computational methods in the study of permutation in groups;Sims,1970

4. Polynomial-time algorithms for permutation groups;Furst,1980

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

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

1. Applications of Finite Non-Abelian Simple Groups to Cryptography in the Quantum Era;La Matematica;2024-04-02

2. Synchronizing words and monoid factorization, yielding a new parameterized complexity class?;Mathematical Structures in Computer Science;2022-02

3. Metric properties of Cayley graphs of alternating groups;Carpathian Mathematical Publications;2021-11-19

4. Approximation algorithms for sorting permutations by extreme block-interchanges;Theoretical Computer Science;2021-11

5. The lower bound of diameter of Alternating groups;Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP