NP-complete?
- From: zeros <mpcm@xxxxxxxxxxxxxx>
- Date: 20 Oct 2005 09:35:58 -0400
Are the discrete log problem and solving of equation x^2=c (mod p) NP-complete problems?
.
- Follow-Ups:
- Re: NP-complete?
- From: RobertSzefler
- Re: NP-complete?
- Prev by Date: Re: Presheaf as functor
- Next by Date: Re: conformal map regular polygone into unit circle.
- Previous by thread: Re: Presheaf as functor
- Next by thread: Re: NP-complete?
- Index(es):
