Re: ::scr tales from the crypto

[Chris Ball <chris@xxxxxxxxxxxxxxx>]

>>>>> "Simon" == Simon Kinahan <simon@xxxxxxxxxxxxxxxxxxx> writes:

    >> Nope.  It's not even proven NP-hard; though I don't have a cite,
    >> so feel free to find a backup.

    Simon> Apparently it is also believed not to be NP-complete, because
    Simon> of something I don't understand:

Looks like they're saying that it isn't NP-complete because there's a
polynomial-time algorithm for it; albeit one that only works on quantum
computers.  :-)

- Chris.
-- 
$a="printf.net"; Chris Ball | chris@void.$a | www.$a | finger: chris@$a
As to luck, there's the old miners' proverb: Gold is where you find it.