Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR98-009 | 25th November 1997 00:00

Parallel complexity of integer coprimality

RSS-Feed




TR98-009
Authors: Bruce Edward Litow
Publication: 13th February 1998 17:50
Downloads: 3289
Keywords: 


Abstract:

It is shown that integer coprimality is in NC.


Comment(s):

Comment #1 to TR98-009 | 11th May 1998 11:33

Parallel complexity of integer coprimality Comment on: TR98-009





Comment #1
Authors: Bruce Edward Litow
Accepted on: 11th May 1998 11:33
Downloads: 1592
Keywords: 


Abstract:

It is shown that integer coprimality is in NC.


Comment #2 to TR98-009 | 20th May 1998 12:27

Parallel complexity of coprimality Comment on: TR98-009





Comment #2
Authors: Bruce Edward Litow
Accepted on: 20th May 1998 12:27
Downloads: 1778
Keywords: 


Abstract:

Correctness of Eq. 3, p. 4 is demonstrated.


Comment #3 to TR98-009 | 11th May 2001 12:33

Comment on parallel complexity of coprimality





Comment #3
Authors: Bruce Edward Litow
Accepted on: 11th May 2001 12:33
Downloads: 3255
Keywords: 


Abstract:

An anonymous SICOMP referee points out what appears to be a
fatal flaw in the method of TR98-09.




ISSN 1433-8092 | Imprint