Equivalence and equation solvability problems for the alternating group <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-Reference-Cited by-同舟云学术

Equivalence and equation solvability problems for the alternating group A4

Author:

Horváth Gábor,Szabó Csaba

Publisher

Elsevier BV

Subject

Algebra and Number Theory

Reference18 articles.

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

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

1. On NP-Complete Search Problems on Finite Algebras;2024 IEEE 54th International Symposium on Multiple-Valued Logic (ISMVL);2024-05-28

3. Satisfiability in MultiValued Circuits;SIAM Journal on Computing;2022-05-05