On Tue, 12 Nov 2002, Nomen Nescio wrote:
According to this link,
http://www.infoanarchy.org/?op=displaystory;sid=2002/11/11/4183/2039,
a new form of digital cash called yodels is being offered anonymously:
[...]
Supposedly, then, this is cash which can be transferred anonymously via
IIP or
Tim wrote:
It would be nice to have crypto
systems based on at least problems which have been shown to be
NP-complete.
Even here, one has to be careful. The knapsack cryptosystem, based on the
NP-Complete problem Subset Sum, crashed and burned spectacularly a number
of years back.
The
--
On 12 Nov 2002 at 8:50, Nomen Nescio wrote:
According to this link,
http://www.infoanarchy.org/?op=displaystory;sid=2002/11/11/4183/2039,
a new form of digital cash called yodels is being offered anonymously:
[...]
Supposedly, then, this is cash which can be transferred
--
On Tue, 12 Nov 2002, Nomen Nescio wrote:
According to this link,
http://www.infoanarchy.org/?op=displaystory;sid=2002/11/11/4183/2039
a new form of digital cash called yodels is being
offered anonymously:
On 12 Nov 2002 at 7:31, Steve Schear wrote:
Correct they are a bearer
Tyler Durden wrote:
(I believe that the non-existence of the last prime number is also
unprovable.)
Could you give some details/ a ref please?
The usual proof by contradiction is easy and well-known. Suppose there is a
last prime. Generate a list of all the primes sooner than or equal to the
Look, I have no idea what your background is, beyond the fact that you're
new to the list and are obviously neither Edward Norton nor Brad Pitt. I
suggest you take a look at some of the books on algorithms, especially the
Harel book. Garey and Johnson is the classic on NP-completeness, but it's
of the United States. The suit was the first
filed by the EEOC to involve a Native
American language.
snip
http://www.upi.com/view.cfm?StoryID=20021112-044422-7977r
[Libscoop: since neither employers nor employees should be coerced, the
employers can morally
require what they want, and the employees
On Tuesday, November 12, 2002, at 11:04 AM, Tim May wrote:
(There are famous examples of using Hamiltonian cycles for giving zero
knowledge proofs. I wrote one up here for the list about 10 years
ago...it may be findable by searching on the right keywords. But using
one of the NP-complete
Unless something really strange happens, McCain takes over the
commerce committee. He's not as bad as Hollings on DRM, which is
damming with faint praise, but hardly laissez-faire in general. He was
one of the backers of the change-stock-options-accounting bill, quick
to campaign against social
