Testing of Properties of Finite Algebras
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Trevor Evans. On multiplicative systems defined by generators and relations , 1953 .
[3] Václav Koubek,et al. Several algorithms for finite algebras , 1979, FCT.
[4] Richard Alan Winton. Subdirectly Irreducible Semigroups , 1978 .
[5] A. Clifford,et al. The algebraic theory of semigroups , 1964 .
[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[7] Dexter Kozen,et al. Complexity of finitely presented algebras , 1977, STOC '77.
[8] Vojtech Rödl,et al. Fast Recognition of Rings and Lattices , 1981, FCT.
[9] Joel Berman,et al. Free lattices in some small varieties , 1980 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Robert E. Tarjan,et al. Determining Whether a Groupoid is a Group , 1972, Inf. Process. Lett..