The Groups of Order at Most 1000 Except 512 and 768

Author： Besche H.U.   Eick B.  

Publisher： Academic Press

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.27, Iss.4, 1999-04, pp. : 405-413

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Most general first order theorems are not recursively enumerable

By Schurz G.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 149-163

Elsevier

Access to resources Recommend Favorite

Classification of Steiner quadruple systems of order 16 and rank at most 131

By Zinoviev V.   Zinoviev D.  

Problems of Information Transmission, Vol. 40, Iss. 4, 2004-10 ,pp. : 337-355

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A heterogeneous computing environment to solve the 768-bit RSA challenge

By Kleinjung Thorsten  

Cluster Computing, Vol. 15, Iss. 1, 2012-03 ,pp. : 53-68

Springer Publishing Company

Access to resources Recommend Favorite

Faculty of 1000

By Shelton Victoria  

The Charleston Advisor, Vol. 8, Iss. 1, 2006-07 ,pp. : 36-36

The Charleston Company

Access to resources Recommend Favorite

Weak-order extensions of an order

By Bertet K.   Gustedt J.   Morvan M.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 249-268

Elsevier

Access to resources Recommend Favorite